Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1182758
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- A fast approximation scheme for fractional covering problems with variable upper bounds
- Rounding algorithms for covering problems
- scientific article; zbMATH DE number 1187151
Cited in
(11)- Multicommodity network flows: A survey. II: Solution methods
- The Lagrangian relaxation for the combinatorial integral approximation problem
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- An improved targeted climbing algorithm for linear programs
- Faster and simpler approximation algorithms for mixed packing and covering problems
- An improved approximation ratio for the minimum linear arrangement problem
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- Advances in Combinatorial Optimization
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Improving the complexities of approximation algorithms for optimization problems
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
This page was built for publication: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596335)
