Pages that link to "Item:Q1403285"

The following pages link to Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285):

Displaying 33 items.

• An implementation of exact knapsack separation (Q330511) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
• On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
• A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
• Path planning on a cuboid using genetic algorithms (Q942312) (← links)
• George Dantzig's impact on the theory of computation (Q951091) (← links)
• Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
• Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
• Reinforcement learning of simplex pivot rules: a proof of concept (Q2080843) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
• Exact solutions to linear programming problems (Q2467437) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
• Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Approaches to the Steiner Problem in Networks (Q3637313) (← links)
• 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 (Q4905621) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
• Reviews (Q5111085) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
• A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
• Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks (Q6169990) (← links)