On pedigree polytopes and Hamiltonian cycles (Q2497514): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An alternate formulation of the symmetric traveling salesman problem and its properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating clique tree and bipartition inequalities in polynomial time / 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: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / 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: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor relations on the convex of cyclic permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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: On the Tours of a Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacency relation on the traveling salesman polytope is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices / rank
 
Normal rank

Latest revision as of 17:32, 24 June 2024

scientific article
Language Label Description Also known as
English
On pedigree polytopes and Hamiltonian cycles
scientific article

    Statements

    On pedigree polytopes and Hamiltonian cycles (English)
    0 references
    0 references
    4 August 2006
    0 references
    Hamiltonian cycles
    0 references
    symmetric traveling salesman problem
    0 references
    pedigree polytope
    0 references
    nonadjacency testing
    0 references
    multistage insertion formulation
    0 references
    flows in networks
    0 references

    Identifiers

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