Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
From MaRDI portal
Publication:6070422
DOI10.1111/itor.12770OpenAlexW3003474212MaRDI QIDQ6070422
Mourad Baïou, Francisco Barahona, Philippe Mahey, Mauricio C. de Souza, Unnamed Author
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12770
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cluster Lagrangean decomposition in multistage stochastic optimization
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A comparison of heuristics and relaxations for the capacitated plant location problem
- About Lagrangian methods in integer optimization
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- A local branching heuristic for the capacitated fixed-charge network design problem
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- New variants of bundle methods
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Comparison of bundle and classical column generation
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- The Cutting-Plane Method for Solving Convex Programs
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Polynomial algorithms in linear programming
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Validation of subgradient optimization
- Generalized Bundle Methods
- Minimization of unsmooth functionals
- The traveling-salesman problem and minimum spanning trees: Part II
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
