Ideal clutters

DOI10.1016/S0166-218X(01)00344-4zbMATH Open1027.90060OpenAlexW2912273745MaRDI QIDQ697573FDOQ697573

Gérard Cornuéjols, Bertrand Guenin

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

Recommendations

• Ideal clutters that do not pack
• On ideal minimally non-packing clutters
• Clutter nonidealness
• scientific article; zbMATH DE number 1933240
• Ideal spaces
• Ideal spaces
• Imperfect and nonideal clutters: A common approach
• Envelopes and clutters
• On a certain class of nonideal clutters
• Publication:3211359

zbMATH Keywords

integer programmingset coveringideal clutterinteger polyhedronideal matrixmax flow min cut probpertywidth-length inequality

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition of regular matroids
• A note on the production of matroid minors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching, Euler tours and the Chinese postman
• A Decomposition for Combinatorial Geometries
• Über eine Eigenschaft der ebenen Komplexe
• Title not available (Why is that?)
• Reliable circuits using less reliable relays
• The extremal length of a network
• A Solution of the Shannon Switching Game
• Bottleneck extrema
• Title not available (Why is that?)
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• A catalog of minimally nonideal matrices
• Ideal 0, 1 matrices
• Packing odd circuits in Eulerian graphs
• Imperfect and nonideal clutters: A common approach
• Combinatorial optimization. Packing and covering
• On the width—length inequality
• On Odd Cuts and Plane Multicommodity Flows
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-Commodity Network Flows
• The max-cut problem on graphs not contractible to \(K_ 5\)
• Edge-disjoint paths in planar graphs
• Combinatorial approaches to multiflow problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A short proof of Guenin's characterization of weakly bipartite graphs
• Title not available (Why is that?)
• Multicommodity flows in planar graphs
• Minimizing submodular functions over families of sets
• Combinatorial designs and related systems
• The Forbidden Minors of Binary Clutters
• Extended Horn sets in propositional logic
• Lehman's forbidden minor characterization of ideal 0-1 matrices
• A class of logic problems solvable by linear programming
• Resolution and the integrality of satisfiability problems
• \((0,\pm 1)\) ideal matrices
• Perfect and ideal \(0, \pm 1\) matrices
• On combinatorial properties of binary spaces
• A two-commodity cut theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The packing property.

Cited In (10)

• Structure of cubic Lehman matrices
• On interval clutters
• An extension of Lehman's theorem and ideal set functions
• Clutter nonidealness
• A Class of Polynomially Solvable Set-Covering Problems
• On a certain class of nonideal clutters
• Imperfect and nonideal clutters: A common approach
• Title not available (Why is that?)
• Combinatorial optimization. Packing and covering
• Combinatorial problems of packing and covering and related problems of integer linear program\-ming

Uses Software

• Leibniz

This page was built for publication: Ideal clutters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697573)