Exact approaches to the single-source network loading problem
From MaRDI portal
Publication:2892148
DOI10.1002/net.20481zbMath1241.90018WikidataQ62048286 ScholiaQ62048286MaRDI QIDQ2892148
Ivana Ljubić, Juan-José Salazar-González, Peter Putz
Publication date: 18 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20481
Related Items
Lagrangian decompositions for the two-level FTTx network design problem, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, Stochastic survivable network design problems: theory and practice, Optimizing splitter and fiber location in a multilevel optical FTTH network, A MIP-based approach to solve the prize-collecting local access network design problem, A cutting plane algorithm for the capacitated connected facility location problem, Towards optimizing the deployment of optical access networks
Uses Software
Cites Work
- A stabilized structured Dantzig-Wolfe decomposition method
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Practical enhancements to the Magnanti-Wong method
- 0-1 reformulations of the multicommodity capacitated network design problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Source sink flows with capacity installation in batches
- Partitioning procedures for solving mixed-variables programming problems
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- On implementing the push-relabel method for the maximum flow problem
- Bidirected and unidirected capacity installation in telecommunication networks.
- Models for representing piecewise linear cost functions
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A survey on Benders decomposition applied to fixed-charge network design problems
- A branch-and-cut algorithm for capacitated network design problems
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Metric inequalities and the network loading problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A note on the selection of Benders' cuts
- Approximating the Single-Sink Link-Installation Problem in Network Design
- Solving the Capacitated Local Access Network Design Problem
- Accelerating Benders Decomposition by Local Branching
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Backbone Network Design Tools with Economic Tradeoffs
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Improved Approximation for Single-Sink Buy-at-Bulk
- Tabu search for a network loading problem with multiple facilities
