Criticizing solutions to relaxed models yields powerful admissible heuristics
- 15 September 1992
- journal article
- Published by Elsevier BV in Information Sciences
- Vol. 63 (3), 207-227
- https://doi.org/10.1016/0020-0255(92)90070-o
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- A result on the computational complexity of heuristic estimates for the A∗ algorithmInformation Sciences, 1984
- A method for computing heuristics in problem solvingInformation Sciences, 1979
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970