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 |
---|---|
格式: | Conference Proceeding |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84964923692&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44757 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
What is the right context for an engineering problem: Finding such a context is NP-hard
由: Martine Ceberio, et al.
出版: (2018) -
Metaheuristics for NP-hard combinatorial optimization problems
由: DINH TRUNG HOANG
出版: (2010) -
What if we only have approximate stochastic dominance?
由: Vladik Kreinovich, et al.
出版: (2018) -
What if we only have approximate stochastic dominance?
由: Vladik Kreinovich, et al.
出版: (2018) -
Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
由: Kyriienko, O., et al.
出版: (2019)