Packing and covering with linear programming: a survey

DOI10.1016/j.ejor.2012.11.045zbMath1292.90002OpenAlexW2144410855MaRDI QIDQ2253646

Cédric Bentz, Bernard Ries, Denis Cornaz

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.11.045

zbMATH Keywords

linear programminghypergraphcoveringpolyhedrapackingmin-max relation

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (3)

On complementary coverage of \({\Omega}_n(T)\) ⋮ Range assignment of base-stations maximizing coverage area without interference ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem

This page was built for publication: Packing and covering with linear programming: a survey