Degree-two Inequalities, Clique Facets, and Biperfect Graphs
DOI10.1016/S0304-0208(08)72450-2zbMATH Open0523.52009OpenAlexW1548435598MaRDI QIDQ3673580FDOQ3673580
Manfred Padberg, Ellis L. Johnson
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)72450-2
inequalitiesconvex hullpolyhedravertex coveringperfect graphsBoolean programmingset packingclique inequality0-1 solutions
Integer programming (90C10) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40) Boolean programming (90C09) Graph theory (05C99)
Cited In (20)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- Uniquely solvable quadratic Boolean equations
- Perfect, ideal and balanced matrices
- The maximum clique problem
- Theoretical challenges towards cutting-plane selection
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Conflict graphs in solving integer programming problems
- Binary integer programs with two variables per inequality
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
- Presolve Reductions in Mixed Integer Programming
- SCIP: solving constraint integer programs
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- Cutting planes in integer and mixed integer programming
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Supernode processing of mixed-integer models
- Some properties of cliques in 0-1 mixed integer programs
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- Worst-case analysis of clique MIPs
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
Recommendations
- Bipartite dimensions and bipartite degrees of graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Bipartite Graphs and their Degree Sets 👍 👎
- Title not available (Why is that?) 👍 👎
- A degree condition of 2-factors in bipartite graphs 👍 👎
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs 👍 👎
- Bicliques in graphs. I: Bounds on their number 👍 👎
- TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES 👍 👎
- Bipartite graphs of large clique-width 👍 👎
This page was built for publication: Degree-two Inequalities, Clique Facets, and Biperfect Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673580)
