A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
From MaRDI portal
Recommendations
- A dual ascent approach to the fixed-charge capacitated network design problem
- LP extreme points and cuts for the fixed-charge network design problem
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Lower bounding techniques for the degree-constrained network design problem
Cited in
(22)- Valid inequalities and separation for uncapacitated fixed charge networks
- A dual ascent approach to the fixed-charge capacitated network design problem
- A model management solution system for multicommodity network flows
- Service network design in freight transportation
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- On a class of branching problems in broadcasting and distribution
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches
- Nonconvex optimization over a polytope using generalized capacity improvement
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- Stochastic optimization models for a single-sink transportation problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Modeling interdependencies in infrastructure systems using multi-layered network flows
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks
- Lower bounding techniques for the degree-constrained network design problem
- CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
- New lower planes for the network design problem
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- The network redesign problem for access telecommunications networks
- Stochastic network design for planning scheduled transportation services: the value of deterministic solutions
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- A metaheuristic for stochastic service network design
This page was built for publication: A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352815)
