On the solution of traveling salesman problems
From MaRDI portal
Publication:1126862
zbMath0904.90165MaRDI QIDQ1126862
William Cook, Robert E. Bixby, Vašek Chvátal, David L. Applegate
Publication date: 6 August 1998
Published in: Documenta Mathematica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233207
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items (50)
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Nagging: A scalable fault-tolerant paradigm for distributed search ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ Decomposition based hybrid metaheuristics ⋮ PackLib\(^{2}\): an integrated library of multi-dimensional packing problems ⋮ Theoretical analysis of singleton arc consistency and its extensions ⋮ The simultaneous semi-random model for TSP ⋮ The dragon war ⋮ On the graphical relaxation of the symmetric traveling salesman polytope ⋮ Analysis of a High-Performance TSP Solver on the GPU ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Transformations of generalized ATSP into ATSP. ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ The time dependent traveling salesman problem: polyhedra and algorithm ⋮ Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research ⋮ A set partitioning reformulation of a school bus scheduling problem ⋮ Small spectral gap in the combinatorial Laplacian implies Hamiltonian ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Review on nature-inspired algorithms ⋮ Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ Lower tolerance-based branch and bound algorithms for the ATSP ⋮ A survey of very large-scale neighborhood search techniques ⋮ Branch and cut methods for network optimization ⋮ Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. ⋮ A branch-and-cut algorithm for graph coloring ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ On 0-1 polytopes with many facets ⋮ Polynomial inequalities representing polyhedra ⋮ Statistical mechanics methods and phase transitions in optimization problems ⋮ Application of multiagent technologies to multiple depot vehicle routing problem with time windows ⋮ Improving strong branching by domain propagation ⋮ Unnamed Item ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Continuous relaxations for the traveling salesman problem ⋮ Continuous reformulations and heuristics for the Euclidean travelling salesperson problem ⋮ Cuts for mixed 0-1 conic programming ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
This page was built for publication: On the solution of traveling salesman problems
