Exact approaches to the single-source network loading problem
From MaRDI portal
Recommendations
Cites work
- 0-1 reformulations of the multicommodity capacitated network design problem
- A branch-and-cut algorithm for capacitated network design problems
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A note on the selection of Benders' cuts
- A stabilized structured Dantzig-Wolfe decomposition method
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition by local branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Approximating the single-sink link-installation problem in network design
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Backbone Network Design Tools with Economic Tradeoffs
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Bidirected and unidirected capacity installation in telecommunication networks.
- Exact solution of multicommodity network optimization problems with general step cost functions
- Improved Approximation for Single-Sink Buy-at-Bulk
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Models for representing piecewise linear cost functions
- Network Design Using Cut Inequalities
- On implementing the push-relabel method for the maximum flow problem
- Partitioning procedures for solving mixed-variables programming problems
- Practical enhancements to the Magnanti-Wong method
- Solving the capacitated local access network design problem
- Source sink flows with capacity installation in batches
- Tabu search for a network loading problem with multiple facilities
- Tailoring Benders decomposition for uncapacitated network design
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Cited in
(17)- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Stochastic survivable network design problems: theory and practice
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- 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
- A partitioning algorithm for the network loading problem
- Benders decomposition for network design covering problems
- Two-criteria problem of distribution of external load for a network with periodic rate of the input flow
- Network Design Using Cut Inequalities
- Exact approaches for designing multifacility buy-at-bulk networks
- An exact approach for the multicommodity network optimization problem with a step cost function
- Efficient presolving methods for the influence maximization problem
- Benders decomposition for congested partial set covering location with uncertain demand
- Lagrangian decompositions for the two-level FTTx network design problem
This page was built for publication: Exact approaches to the single-source network loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892148)
