Characterizing and bounding the imperfection ratio for some classes of graphs

DOI10.1007/s10107-007-0182-9zbMath1169.90025OpenAlexW2011676058MaRDI QIDQ1016110

Arnaud Pêcher, Sylvain Coulonges, Annegret K. Wagler

Publication date: 4 May 2009

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

Full work available at URL: https://doi.org/10.1007/s10107-007-0182-9

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Comparing Imperfection Ratio and Imperfection Index for Graph Classes, The nonidealness index of circulant matrices, Characterizing N+-perfect line graphs, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, Unnamed Item, The nonidealness index of rank-ideal matrices, On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets, Lovász-Schrijver PSD-Operator on Claw-Free Graphs, On determining the imperfection ratio

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Geometric algorithms and combinatorial optimization
• On certain polytopes associated with graphs
• Graph imperfection. I
• Graph imperfection. II
• Antiwebs are rank-perfect
• Applying Lehman's theorems to packing problems
• On rank-perfect subclasses of near-bipartite graphs
• Coloring quasi-line graphs
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Sur le coloriage des graphs
• Circular chromatic number: A survey