Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
From MaRDI portal
Publication:3057143
DOI10.1002/net.20362zbMath1200.90029OpenAlexW4256141174MaRDI QIDQ3057143
Teodor Gabriel Crainic, Tolga Bektaş, Mervat Chouman
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20362
Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items
Multimodal freight transportation planning: a literature review, A conic quadratic formulation for a class of convex congestion functions in network flow problems
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- Service network design in freight transportation
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Multicommodity network design with discrete node costs
- Heuristic solutions for general concave minimum cost network flow problems
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Validation of subgradient optimization
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
