A language and a program for stating and solving combinatorial problems
- 28 February 1978
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 10 (1), 29-127
- https://doi.org/10.1016/0004-3702(78)90029-2
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- An algorithm for the 0/1 Knapsack problemMathematical Programming, 1978
- A heuristic problem solving design system for equipment or furniture layoutsCommunications of the ACM, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- A Method for Solving Discrete Optimization ProblemsOperations Research, 1966
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960