Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

DOI10.1287/opre.1050.0262zbMath1167.90661OpenAlexW2022683391MaRDI QIDQ3391969

Jean-Philippe Vial, Olivier du Merle, Frédéric Babonneau

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://archive-ouverte.unige.ch/unige:5765

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (12)

Large-scale optimization with the primal-dual column generation method ⋮ Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ Algorithms for multiplayer multicommodity flow problems ⋮ Dynamic bundle methods ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ Optimization in liner shipping ⋮ Optimization in liner shipping ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ Traffic Networks and Flows over Time ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design ⋮ Chebyshev center based column generation

Uses Software

• IPM

This page was built for publication: Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM