Prize‐collecting set multicovering with submodular pricing

DOI10.1111/ITOR.12420zbMATH Open1395.90216OpenAlexW2614214831MaRDI QIDQ5374518FDOQ5374518

Daniel Cosmin Porumbel

Publication date: 14 September 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12420

Recommendations

• Approximation algorithm for the stochastic prize-collecting set multicover problem
• An approximation algorithm for \(P\)-prize-collecting set cover problem
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• Efficient cost-sharing mechanisms for prize-collecting problems
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Approximation algorithms for prize collecting forest problems with submodular penalty functions
• THE MULTIPLE SUBSET COUPON COLLECTING PROBLEM
• Computing and Combinatorics
• An approximation algorithm for the \(H\)-prize-collecting power cover problem
• Algorithms for covering multiple submodular constraints and applications

zbMATH Keywords

column generationsubmodular functionset multi-coveringlarge-scale linear programs

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Cited In (1)

• Approximation and Online Algorithms

This page was built for publication: Prize‐collecting set multicovering with submodular pricing

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