scientific article; zbMATH DE number 2230198

MaRDI QIDQ5708482zbMATH OpenFDO

Authors

Publication date 18 November 2005

Full work available at URL http://www.sciencedirect.com/science/journal/15710653

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites work

• scientific article; zbMATH DE number 16723 (Why is no real title available?)
• scientific article; zbMATH DE number 3513556 (Why is no real title available?)
• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
• Applying Lehman's theorems to packing problems
• Combinatorial optimization. Packing and covering
• Geometric algorithms and combinatorial optimization
• Graph imperfection. I
• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Near-perfect matrices
• On the 0,1 facets of the set covering polytope
• The disjunctive procedure and blocker duality

Cited in

(1)

• On a certain class of nonideal clutters

This page was built for publication:

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