An analytical comparison of different formulations of the travelling salesman problem (Q1181739): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über homogene lineare Ungleichungssysteme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Formulation for the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the width—length inequality / 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: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytic symmetrization of max flow-min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementare Theorie der konvexen Polyeder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programming: A survey / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582894 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985322505 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 30 July 2024

scientific article
Language Label Description Also known as
English
An analytical comparison of different formulations of the travelling salesman problem
scientific article

    Statements

    An analytical comparison of different formulations of the travelling salesman problem (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    convex polyhedral cones
    0 references
    affine transformations
    0 references
    transformation technique
    0 references
    asymmetric travelling salesman
    0 references

    Identifiers