Curse of scale-freeness: intractability of large-scale optimization with multi-start methods
From MaRDI portal
Cites work
- A statistical approach to the tsp
- Confidence in heuristic solutions?
- Extreme value theory. An introduction.
- scientific article; zbMATH DE number 43570 (Why is no real title available?)
- scientific article; zbMATH DE number 3573593 (Why is no real title available?)
- scientific article; zbMATH DE number 1026574 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- Interval estimation of a global optimum for large combinatorial problems
- Multi-start methods for combinatorial optimization
- On statistical bounds of heuristic solutions to location problems
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Point estimation of a global optimum for large combinatorial problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search: Principles and applications
This page was built for publication: Curse of scale-freeness: intractability of large-scale optimization with multi-start methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942782)