scientific article; zbMATH DE number 3495892

MaRDI QIDQ4077762zbMATH OpenFDO

Authors

Publication date 1975

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(12)

• On cutting-plane proofs in combinatorial optimization
• Penelope's graph: a hard minimum cost tension instance
• Polyhedral results for a vehicle routing problem
• A strongly polynomial algorithm for the minimum cost tension problem
• Survey of facial results for the traveling salesman polytope
• The skeleton of the symmetric Traveling Salesman Polytope
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• Hamiltonian path and symmetric travelling salesman polytopes
• Enveloppe convexe des hyperplans d'un espace affine fini
• The facets of the subtour polytope
• A spectral approach to polyhedral dimension
• On the graphical relaxation of the symmetric traveling salesman polytope

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077762)