What is the right context for an engineering problem: Finding such a context is NP-hard
© 2015 IEEE. In the general case, most computational engineering problems are NP-hard. So, to make the problem feasible, it is important to restrict this problem. Ideally, we should use the most general context in which the problem is still feasible. In this paper, we prove that finding such most ge...
Saved in:
Main Authors: | Martine Ceberio, Vladik Kreinovich, Hung T. Nguyen, Songsak Sriboonchitta, Rujira Oncharoen |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84964923692&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54409 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
What is the right context for an engineering problem: Finding such a context is NP-hard
by: Martine Ceberio, et al.
Published: (2018) -
Metaheuristics for NP-hard combinatorial optimization problems
by: DINH TRUNG HOANG
Published: (2010) -
What if we only have approximate stochastic dominance?
by: Vladik Kreinovich, et al.
Published: (2018) -
What if we only have approximate stochastic dominance?
by: Vladik Kreinovich, et al.
Published: (2018) -
Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
by: Kyriienko, O., et al.
Published: (2019)