The prize collecting traveling salesman problem
- 1 October 1989
- Vol. 19 (6) , 621-636
- https://doi.org/10.1002/net.3230190602
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Faces for a linear inequality in 0–1 variablesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973