scientific article; zbMATH DE number 2230198

zbMATH Open1075.05512MaRDI QIDQ5708482FDOQ5708482

Author name not available (Why is that?)

Publication date: 18 November 2005

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites Work

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

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)