Binary integer programs with two variables per inequality
From MaRDI portal
Recommendations
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
- scientific article; zbMATH DE number 1405787
Cites work
- A cascade algorithm for the logical closure of a set of binary relations
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- An extension of the König-Egerváry property to node-weighted bidirected graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- scientific article; zbMATH DE number 3644798 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Solving Large-Scale Zero-One Linear Programming Problems
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Vertex packings: Structural properties and algorithms
Cited in
(5)- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
- scientific article; zbMATH DE number 1757949 (Why is no real title available?)
- scientific article; zbMATH DE number 1405787 (Why is no real title available?)
- Perfect, ideal and balanced matrices
This page was built for publication: Binary integer programs with two variables per inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363421)
