Binary integer programs with two variables per inequality

DOI10.1007/BF02592194zbMath0874.90138OpenAlexW1998259606MaRDI QIDQ1363421

Edward C. Sewell

Publication date: 7 August 1997

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

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

zbMATH Keywords

perfect graphsbidirected graphsmaximum weight stable set problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs ⋮ Perfect, ideal and balanced matrices

Cites Work

• Unnamed Item
• An extension of the König-Egerváry property to node-weighted bidirected graphs
• A cascade algorithm for the logical closure of a set of binary relations
• Critical perfect graphs and perfect 3-chromatic graphs
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• Solving Large-Scale Zero-One Linear Programming Problems
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Vertex packings: Structural properties and algorithms

This page was built for publication: Binary integer programs with two variables per inequality