Packing and covering with linear programming: a survey
From MaRDI portal
Recommendations
- Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
- Approximation algorithms for covering/packing integer programs
- New approaches to covering and packing problems
- Combinatorial problems of packing and covering and related problems of integer linear program\-ming
- Covering and Packing in Linear Space
- Covering and packing in linear space
- Packing interdiction and partial covering problems
- Approximation of optima of integer programs of the packing—covering type
- scientific article; zbMATH DE number 480248
Cited in
(13)- Covering and Packing in Linear Space
- On complementary coverage of \({\Omega}_n(T)\)
- Mode packing and perfect graphs
- On the relationship between disjunctive relaxations and minors in packing and covering problems
- A Short Introduction to Optimal Line Packings
- Cover and pack inequalities for (mixed) integer programming
- A Robust PTAS for Machine Covering and Packing
- Covering and packing in linear space
- Range assignment of base-stations maximizing coverage area without interference
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- Combinatorial optimization. Packing and covering
- Combinatorial problems of packing and covering and related problems of integer linear program\-ming
This page was built for publication: Packing and covering with linear programming: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253646)
