Optimization of a 532-city symmetric traveling salesman problem by branch and cut
From MaRDI portal
Publication:1089267
DOI10.1016/0167-6377(87)90002-2zbMath0618.90082WikidataQ58002963 ScholiaQ58002963MaRDI QIDQ1089267
Publication date: 1987
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(87)90002-2
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C27: Combinatorial optimization
Related Items
Polyhedral techniques in combinatorial optimization I: Theory, Polyhedral study of the capacitated vehicle routing problem, The discipline number of a graph, Polyhedral results for a vehicle routing problem, Expressing combinatorial optimization problems by linear programs, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, Large-step Markov chains for the TSP incorporating local search heuristics, The complexity of lifted inequalities for the knapsack problem, Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem, The complexity of cover inequality separation, A cutting-plane approach to the edge-weighted maximal clique problem, A technique for speeding up the solution of the Lagrangean dual, A parallel tabu search algorithm for large traveling salesman problems, Genetically improved presequences for Euclidean traveling salesman problems, A polyhedral approach to the rural postman problem, A branch-and-cut algorithm for the equicut problem, An effective implementation of the Lin-Kernighan traveling salesman heuristic, A polyhedral approach to sequence alignment problems, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, Combinatorial optimization and small polytopes, Routing problems: A bibliography, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, Combining simulated annealing with local search heuristics, Genetic algorithms for the traveling salesman problem, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Topological design of a two-level network with ring-star configuration, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Playing Billiards in Version Space
