Where the really hard problems aren’t
Not all problem instances in combinatorial optimization are equally hard. One famous study “Where the Really Hard Problems Are” shows that for three decision problems and one optimization problem, computational costs can vary dramatically for equally sized instances. Moreover, runtimes could be pred...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2020-01-01
|
| Series: | Operations Research Perspectives |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2214716020300506 |