The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58002939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linear admissible transformations for the m- travelling salesmen problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Travelling Salesman Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete description of the traveling salesman polytope on 8 nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of cutting planes for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Crown Inequalities for the Symmetric Traveling Salesman Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01581259 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964127155 / rank
 
Normal rank

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
scientific article

    Statements

    The graphical relaxation: A new framework for the symmetric traveling salesman polytope (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    polyhedron
    0 references
    linear inequality
    0 references
    composition of inequalities
    0 references
    symmetric traveling salesman polytope
    0 references
    graphical relaxation
    0 references
    facet-defining inequalities
    0 references
    lifting theorems
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers