Pages that link to "Item:Q4427382"

The following pages link to A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems (Q4427382):

Displaying 33 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
• An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← 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)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
• A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan (Q1632965) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)
• New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
• Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
• Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems (Q2884565) (← links)
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
• A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem (Q3116758) (← links)
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
• Dual-ascent methods for large-scale multicommodity flow problems (Q4697327) (← links)
• (Q5020878) (← 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)
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)