Ideal clutters
From MaRDI portal
Publication:697573
DOI10.1016/S0166-218X(01)00344-4zbMath1027.90060OpenAlexW2912273745MaRDI QIDQ697573
Cornuéjols, Gérard, Guenin, Bertrand
Publication date: 17 September 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00344-4
integer programmingset coveringideal clutterinteger polyhedronideal matrixmax flow min cut probpertywidth-length inequality
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Edge-disjoint paths in planar graphs
- Combinatorial approaches to multiflow problems
- The extremal length of a network
- Decomposition of regular matroids
- Multicommodity flows in planar graphs
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- A note on the production of matroid minors
- A two-commodity cut theorem
- A catalog of minimally nonideal matrices
- Ideal 0, 1 matrices
- Resolution and the integrality of satisfiability problems
- \((0,\pm 1)\) ideal matrices
- Packing odd circuits in Eulerian graphs
- Imperfect and nonideal clutters: A common approach
- A short proof of Guenin's characterization of weakly bipartite graphs
- Minimizing submodular functions over families of sets
- Combinatorial designs and related systems
- Über eine Eigenschaft der ebenen Komplexe
- Combinatorial Optimization
- Perfect and Ideal 0, ±1 Matrices
- On the width—length inequality
- On Odd Cuts and Plane Multicommodity Flows
- The Forbidden Minors of Binary Clutters
- Extended Horn sets in propositional logic
- A class of logic problems solvable by linear programming
- Matching, Euler tours and the Chinese postman
- On combinatorial properties of binary spaces
- A Solution of the Shannon Switching Game
- Bottleneck extrema
- A Decomposition for Combinatorial Geometries
- Reliable circuits using less reliable relays
- Multi-Commodity Network Flows
- The packing property.