Potential function methods for approximately solving linear programming problems: theory and practice.
From MaRDI portal
Publication:1422252
zbMath1088.90001MaRDI QIDQ1422252
Publication date: 8 February 2004
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (25)
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ An interior-point approach for primal block-angular problems ⋮ Solving MIPs via scaling-based augmentation ⋮ On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Barrier subgradient method ⋮ First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games ⋮ A least-squares minimum-cost network flow algorithm ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ A nearly linear-time PTAS for explicit fractional packing and covering linear programs ⋮ Metric inequalities and the network loading problem ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ Maximizing residual capacity in connection-oriented networks ⋮ Faster min-max resource sharing in theory and practice ⋮ Exponential penalty function control of loss networks ⋮ Self-concordant barriers for convex approximations of structured convex sets ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ k -Splittable delay constrained routing problem: A branch-and-price approach ⋮ Rounding of convex sets and efficient gradient methods for linear programming problems ⋮ Interior-point solver for convex separable block-angular problems ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem ⋮ On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths ⋮ A branch-and-cut algorithm for multiple sequence alignment
This page was built for publication: Potential function methods for approximately solving linear programming problems: theory and practice.
