On the Membership Problem of the Pedigree Polytope

DOI10.1142/9789812813220_0006zbMath1223.90079OpenAlexW2495484992MaRDI QIDQ3542362

No author found.

Publication date: 1 December 2008

Published in: Mathematical Programming and Game Theory for Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812813220_0006

zbMATH Keywords

Hamiltonian cyclesmembership problemsymmetric traveling salesman problemmultistage insertion formulationpedigree polytope

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines ⋮ Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration

This page was built for publication: On the Membership Problem of the Pedigree Polytope