An inexact algorithm for the sequential ordering problem
- 1 November 1988
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 37 (2) , 236-249
- https://doi.org/10.1016/0377-2217(88)90333-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Facets of the linear ordering polytopeMathematical Programming, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed GraphACM Transactions on Mathematical Software, 1983
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Local Search for the Asymmetric Traveling Salesman ProblemOperations Research, 1980
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980