Pages that link to "Item:Q4509740"

The following pages link to A Specialized Interior-Point Algorithm for Multicommodity Network Flows (Q4509740):

Displaying 36 items.

• IPM (Q17310) (← links)
• Mathematical programming approaches for classes of random network problems (Q319592) (← links)
• Crash start of interior point methods (Q323526) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• Existence, uniqueness, and convergence of the regularized primal-dual central path (Q613327) (← links)
• Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
• Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
• Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning (Q1010307) (← links)
• Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations (Q1033215) (← links)
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
• Solving difficult multicommodity problems with a specialized interior-point algorithm (Q1417769) (← links)
• Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems (Q1948525) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
• An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) (← links)
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (Q2455638) (← links)
• Minimum-distance controlled perturbation methods for large-scale tabular data protection (Q2576244) (← links)
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
• An interior-point approach for primal block-angular problems (Q2643610) (← links)
• Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
• A linear model for compound multicommodity network flow problems (Q2654399) (← links)
• Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
• Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
• (Q5020878) (← links)
• A new interior-point approach for large separable convex quadratic two-stage stochastic problems (Q5043842) (← links)
• On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
• Experiments with a hybrid interior point/combinatorial approach for network flow problems (Q5436921) (← links)
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)
• On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach (Q6113326) (← links)
• New interior-point approach for one- and two-class linear support vector machines using multiple variable splitting (Q6596335) (← links)