The following pages link to (Q4398370):
Displayed 6 items.
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
- On Pedigree Polytopes and Hamiltonian Cycles (Q3439015) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem (Q5952070) (← links)