Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
From MaRDI portal
Publication:1403285
DOI10.1007/s10107-003-0440-4zbMath1106.90369OpenAlexW1652378708MaRDI QIDQ1403285
Robert E. Bixby, William Cook, Vašek Chvátal, David L. Applegate
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0440-4
Related Items
Reviews, Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem, An implementation of exact knapsack separation, Lifted and local reachability cuts for the vehicle routing problem with time windows, Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics, A branch‐and‐cut algorithm for the ring spur assignment problem, On the graphical relaxation of the symmetric traveling salesman polytope, Simultaneously exploiting two formulations: an exact Benders decomposition approach, A partitioning column approach for solving LED sorter manipulator path planning problems, A note on computational aspects of the Steiner traveling salesman problem, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks, A lower bound on the Hamiltonian path completion number of a line graph, Generating partitions of a graph into a fixed number of minimum weight cuts, Path planning on a cuboid using genetic algorithms, 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, Exact solutions to linear programming problems, Local search algorithms for finding the Hamiltonian completion number of line graphs, George Dantzig's impact on the theory of computation, Exact algorithms for the equitable traveling salesman problem, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem, Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs, Certification of an optimal TSP tour through 85,900 cities, Computational experience with general cutting planes for the set covering problem, Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable, Approaches to the Steiner Problem in Networks, The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches, Reinforcement learning of simplex pivot rules: a proof of concept, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, A note on single alternating cycle neighborhoods for the TSP, On the facial structure of symmetric and graphical traveling salesman polyhedra, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
Uses Software
