Ideal polytopes and face structures of some combinatorial optimization problems

DOI10.1007/BF01592241zbMath0855.90107OpenAlexW2044332237MaRDI QIDQ1924055

Akihisa Tamura, Yoshiko T. Ikebe

Publication date: 12 January 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01592241

zbMATH Keywords

heuristicset packingvertex coloringset partitioningmaximum stable set problem

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items (1)

Vertex adjacencies in the set covering polyhedron

Cites Work

• Solution of large-scale symmetric travelling salesman problems
• On certain polytopes associated with graphs
• Adjacency on combinatorial polyhedra
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The travelling salesman problem and a class of polyhedra of diameter two
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
• Set Partitioning: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ideal polytopes and face structures of some combinatorial optimization problems