Pages that link to "Item:Q4161085"
From MaRDI portal
The following pages link to Technical Note—On the Expected Performance of Branch-and-Bound Algorithms (Q4161085):
Displayed 7 items.
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)