Primal-dual schema for capacitated covering problems
From MaRDI portal
(Redirected from Publication:747765)
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
Cites work
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A unified approach to approximating resource allocation and scheduling
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- An improved approximation algorithm for vertex cover with hard capacities
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
- Capacitated Facility Location: Valid Inequalities and Facets
- Covering Problems with Hard Capacities
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Primal-Dual Schema for Capacitated Covering Problems
- Single item lot-sizing with non-decreasing capacities
- Valid Linear Inequalities for Fixed Charge Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
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
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- A note on submodular function minimization with covering type linear constraints
- scientific article; zbMATH DE number 910865 (Why is no real title available?)
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Primal-Dual Schema for Capacitated Covering Problems
- A fast algorithm for the rectilinear distance location problem
- scientific article; zbMATH DE number 2086430 (Why is no real title available?)
- 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)
