Primal-dual schema for capacitated covering problems
From MaRDI portal
Publication:747765
DOI10.1007/S10107-014-0803-ZzbMATH Open1327.90252OpenAlexW1964001041MaRDI QIDQ747765FDOQ747765
Publication date: 19 October 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0803-z
Recommendations
- Primal-Dual Schema for Capacitated Covering Problems
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
- Publication:4886039
- scientific article; zbMATH DE number 2086430
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
Linear programming (90C05) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Primal-Dual Schema for Capacitated Covering Problems
- A General Approximation Technique for Constrained Forest Problems
- Title not available (Why is that?)
- A linear-time approximation algorithm for the weighted vertex cover problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A unified approach to approximating resource allocation and scheduling
- Capacitated Facility Location: Valid Inequalities and Facets
- Valid Linear Inequalities for Fixed Charge Problems
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- Single item lot-sizing with non-decreasing capacities
- An improved approximation algorithm for vertex cover with hard capacities
- Covering Problems with Hard Capacities
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
Cited In (12)
- Easy capacitated facility location problems, with connections to lot-sizing
- An approximation algorithm for the partial covering 0-1 integer program
- Greedy algorithms for the single-demand facility location problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on submodular function minimization with covering type linear constraints
- Title not available (Why is that?)
- Primal-Dual Schema for Capacitated Covering Problems
- Title not available (Why is that?)
- A fast algorithm for the rectilinear distance location problem
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems
- Precedence-constrained covering problems with multiplicity constraints
This page was built for publication: Primal-dual schema for capacitated covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747765)
