Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
From MaRDI portal
Recommendations
- On the solution of traveling salesman problems
- scientific article; zbMATH DE number 795217
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Solution of large-scale symmetric travelling salesman problems
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
Cited in
(33)- Local search algorithms for finding the Hamiltonian completion number of line graphs
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Exact algorithms for the equitable traveling salesman problem
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- On the graphical relaxation of the symmetric traveling salesman polytope
- Reviews
- Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
- Certification of an optimal TSP tour through 85,900 cities
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- Approaches to the Steiner Problem in Networks
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- 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 lower bound on the Hamiltonian path completion number of a line graph
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
- Path planning on a cuboid using genetic algorithms
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- A note on single alternating cycle neighborhoods for the TSP
- A partitioning column approach for solving LED sorter manipulator path planning problems
- Computational experience with general cutting planes for the set covering problem
- A branch-and-cut algorithm for the ring spur assignment problem
- Reinforcement learning of simplex pivot rules: a proof of concept
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Exact solutions to linear programming problems
- A note on computational aspects of the Steiner traveling salesman problem
- George Dantzig's impact on the theory of computation
This page was built for publication: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403285)
