Exact solution of large-scale, asymmetric traveling salesman problems
From MaRDI portal
Publication:4371607
DOI10.1145/212066.212081zbMath0887.65058OpenAlexW1986985656WikidataQ59222314 ScholiaQ59222314MaRDI QIDQ4371607
Mauro Dell'Amico, Giorgio Carpaneto, Paolo Toth
Publication date: 26 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1995-21/
branch-and-bound algorithmreductionassignment problemasymmetric traveling salesman problemelimination branching schemeno wait flow shop problemsstacker crane problems
Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A learning based algorithm for drone routing, Algorithms and codes for dense assignment problems: The state of the art, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Towards backbone computing: A Greedy-Whitening based approach, Improved filtering for weighted circuit constraints, Special Frequency Quadrilaterals and an Application, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, An exact method for scheduling a yard crane, Tolerance-based branch and bound algorithms for the ATSP, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, Designing the master schedule for demand-adaptive transit systems, Lower tolerance-based branch and bound algorithms for the ATSP, Iterative patching and the asymmetric traveling salesman problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem, A review of TSP based approaches for flowshop scheduling
Uses Software
