On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
From MaRDI portal
Publication:2944569
Recommendations
- scientific article; zbMATH DE number 1342139
- Approximation of optima of integer programs of the packing—covering type
- Approximation algorithms for covering/packing integer programs
- Primal-dual approximation algorithms for a packing-covering pair of problems
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- scientific article; zbMATH DE number 1263202
- Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
- Parameterized approximation algorithms for packing problems
- Approximation Schemes for Covering and Packing
- scientific article; zbMATH DE number 1839427
Cites work
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 3625111 (Why is no real title available?)
- scientific article; zbMATH DE number 1342139 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- A Survey of Lagrangean Techniques for Discrete Optimization
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- A sublinear-time randomized approximation algorithm for matrix games
- A suggested computation for maximal multi-commodity network flows
- Adaptive game playing using multiplicative weights
- Approximate max-min resource sharing for structured concave optimization
- Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
- Approximating semidefinite packing programs
- Coordination Complexity of Parallel Price-Directive Decomposition
- Decomposition Principle for Linear Programs
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast approximation algorithms for multicommodity flow problems
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Geometric algorithms and combinatorial optimization.
- How Hard Is It to Approximate the Best Nash Equilibrium?
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
- Nearly-linear time positive LP solver with faster convergence rate
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Simple strategies for large zero-sum games with applications to complexity theory
- Smooth minimization of non-smooth functions
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The many facets of linear programming
- The maximum concurrent flow problem
- The multiplicative weights update method: a meta-algorithm and applications
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(4)
This page was built for publication: On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944569)
