On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Exact Integrality Gap for Small Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving convex programs by random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2999650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP on Cubic and Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex-hull-and-line traveling salesman problem: A solvable case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving branch-and-cut performance by random sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integrality ratio of the subtour LP for Euclidean TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard to solve instances of the Euclidean traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic vertices of the metric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hit-and-run mixes fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for constrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a constrained traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Revision as of 09:37, 2 August 2024

scientific article; zbMATH DE number 7716159
Language Label Description Also known as
English
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
scientific article; zbMATH DE number 7716159

    Statements

    On the generation of metric TSP instances with a large integrality gap by branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2023
    0 references
    integer programming
    0 references
    integrality gap analysis
    0 references
    branch-and-cut
    0 references
    metric traveling salesman problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references