scientific article; zbMATH DE number 5773533

MaRDI QIDQ3585507zbMATH OpenFDO

Authors O. Annen

Publication date 19 August 2010

Full work available at URL http://duepublico.uni-duisburg-essen.de/servlets/DocumentServlet?id=5497

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approach to the solution of the set-covering problem
• scientific article; zbMATH DE number 1754596
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• A unified approach to approximating partial covering problems
• A Unified Approach to Approximating Partial Covering Problems
• Solution of problems of minimal set partition and set covering
• scientific article; zbMATH DE number 4106856
• Probabilistic partial set covering problems
• Graph theoretic relaxations of set covering and set partitioning problems

Cited in

(2)

• scientific article; zbMATH DE number 1354909 (Why is no real title available?)
• scientific article; zbMATH DE number 1973993 (Why is no real title available?)

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 Q3585507)