Pages that link to "Item:Q1422252"

The following pages link to Potential function methods for approximately solving linear programming problems: theory and practice. (Q1422252):

Displaying 25 items.

• First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
• Faster min-max resource sharing in theory and practice (Q542051) (← links)
• Barrier subgradient method (Q633113) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
• A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• Maximizing residual capacity in connection-oriented networks (Q955490) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• Exponential penalty function control of loss networks (Q1769408) (← links)
• Metric inequalities and the network loading problem (Q2471279) (← links)
• An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
• A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
• An interior-point approach for primal block-angular problems (Q2643610) (← links)
• Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
• (Q5020877) (← links)
• (Q5020878) (← links)
• On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
• Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)