Solution of large-scale symmetric travelling salesman problems (Q810369): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / 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 man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex variant for the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving matching problems with linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for minimum perfect 2-matchings / 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: Geometric algorithms and combinatorial optimization / 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: Q3714901 / 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: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820374 / 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: Odd Minimum Cut-Sets and <i>b</i>-Matchings / 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: An efficient algorithm for the minimum capacity cut 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: Q4145160 / rank
 
Normal rank

Latest revision as of 10:08, 24 June 2024

scientific article
Language Label Description Also known as
English
Solution of large-scale symmetric travelling salesman problems
scientific article

    Statements

    Solution of large-scale symmetric travelling salesman problems (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polyhedral combinatorics
    0 references
    cutting plane procedure
    0 references
    symmetric travelling salesman
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references