A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
From MaRDI portal
Publication:4427382
DOI10.1287/ijoc.11.4.370zbMath1034.90534OpenAlexW1977747978WikidataQ118165528 ScholiaQ118165528MaRDI QIDQ4427382
Antonio Frangioni, Giorgio Gallo
Publication date: 6 November 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.11.4.370
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Large-scale optimization with the primal-dual column generation method, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking, Prim-based support-graph preconditioners for min-cost flow problems, Dynamic bundle methods, Solving a dynamic facility location problem with partial closing and reopening, A branch-and-price algorithm for the capacitated facility location problem, Cyclic preference scheduling of nurses using a Lagrangian-based heuristic, On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Unnamed Item, Quadratic regularizations in an interior-point method for primal block-angular problems, Accelerated multigrid for graph Laplacian operators, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Experiments with a hybrid interior point/combinatorial approach for network flow problems, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, New approaches for optimizing over the semimetric polytope, About Lagrangian methods in integer optimization
Uses Software
