Optimization of a 532-city symmetric traveling salesman problem by branch and cut

DOI10.1016/0167-6377(87)90002-2zbMath0618.90082OpenAlexW3139666781WikidataQ58002963 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

zbMATH Keywords

branch and cut software design polyhedral methods 532-city symmetric traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Related Items

A parallel tabu search algorithm for large traveling salesman problems, 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, Genetically improved presequences for Euclidean traveling salesman problems, A polyhedral approach to the rural postman problem, Computing minimal forecast horizons: an integer programming approach, Strategies for LP-based solving a general class of scheduling problems, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, Method of scaling in approximate solution of the traveling salesman problem, Routing problems: A bibliography, A branch-and-cut algorithm for the equicut problem, Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, The Boolean quadratic polytope: Some characteristics, facets and relatives, A cutting plane algorithm for a clustering problem, Combining simulated annealing with local search heuristics, Genetic algorithms for the traveling salesman problem, Experiments in quadratic 0-1 programming, Order batching using an approximation for the distance travelled by pickers, Optimally solving the joint order batching and picker routing problem, Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions, Logic-based Benders decomposition for wildfire suppression, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, Information-theoretic approaches to branching in search, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, The generalized assignment problem: Valid inequalities and facets, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Facet identification for the symmetric traveling salesman polytope, Exact and inexact solution procedures for the order picking in an automated carousal conveyor, An efficient algorithm for the minimum capacity cut problem, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, The discipline number of a graph, Polyhedral results for a vehicle routing problem, Expressing combinatorial optimization problems by linear programs, Classical cuts for mixed-integer programming and branch-and-cut, Optimality conditions to the acyclic travelling salesman problem., Separating maximally violated comb inequalities in planar graphs, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, Exact methods for solving the elementary shortest and longest path problems, Point-to-point and multi-goal path planning for industrial robots, Large-step Markov chains for the TSP incorporating local search heuristics, Integrating rolling stock scheduling with train unit shunting, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, The complexity of lifted inequalities for the knapsack problem, Polyhedral study of the capacitated vehicle routing problem, A tutorial on branch and cut algorithms for the maximum stable set problem, Fast bounding procedures for large instances of the simple plant location problem, Genetic algorithm for combinatorial path planning: the subtour problem, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Path optimization with limited sensing ability, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, Large-scale 0-1 linear programming on distributed workstations, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Polyhedral techniques in combinatorial optimization I: Theory, Combinatorial optimization and small polytopes, Facets and algorithms for capacitated lot sizing, New lower bounds for the symmetric travelling salesman problem, Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem, An effective implementation of the Lin-Kernighan traveling salesman heuristic, A polyhedral approach to sequence alignment problems, Playing Billiards in Version Space, The complexity of cover inequality separation, Case injected genetic algorithms for traveling salesman problems, A cutting-plane approach to the edge-weighted maximal clique problem, Survey of facial results for the traveling salesman polytope, A branch-and-price approach for the continuous multifacility monotone ordered median problem, A technique for speeding up the solution of the Lagrangean dual, Solution of large-scale symmetric travelling salesman problems, Mathematical programming formulations for machine scheduling: A survey, Relaxed tours and path ejections for the traveling salesman problem, Fuzzy commercial traveler problem of trapezoidal membership functions within the sort of \(\alpha \) optimum solution using ranking technique

Cites Work