Monotone covering problems with an additional covering constraint

DOI10.1287/MOOR.1080.0356zbMATH Open1218.90168OpenAlexW2143712765WikidataQ65553910 ScholiaQ65553910MaRDI QIDQ3169028FDOQ3169028

Authors: José R. Correa, Asaf Levin 

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1080.0356

Recommendations

• An improved approximation algorithm for the covering 0-1 integer program
• Approximation algorithms for covering/packing integer programs
• Approximating covering integer programs with multiplicity constraints
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• Approximation Algorithms for a Network Design Problem

zbMATH Keywords

approximation algorithmsLagrangian relaxationcovering integer programs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cited In (1)

• New approaches to multi-objective optimization

This page was built for publication: Monotone covering problems with an additional covering constraint

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