Pages that link to "Item:Q2428688"
From MaRDI portal
The following pages link to Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688):
Displaying 4 items.
- Limitations of incremental dynamic programming (Q517805) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)