A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
From MaRDI portal
Publication:2288988
Recommendations
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- A Lagrangian relaxation approach for expansion of a highway network
- Capacitated network design with uncertain demand
Cites work
- A class of stochastic programs with decision dependent uncertainty
- A coordinated production planning model with capacity expansion and inventory management
- A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity
- An algorithm for optimizing network flow capacity under economies of scale
- An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacity expansion planning for a single facility product line
- Cargo capacity management with allotments and spot market demand
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution
- Dual decomposition in stochastic integer programming
- Dual sourcing using capacity reservation and spot market: optimal procurement policy and heuristic parameter determination
- scientific article; zbMATH DE number 3266259 (Why is no real title available?)
- scientific article; zbMATH DE number 3278984 (Why is no real title available?)
- Increasing the capacity of a network: the parametric budget problem
- Lagrangean relaxation. (With comments and rejoinder).
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Models for planning capacity expansion in local access telecommunication networks
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Operations Research and Capacity Expansion Problems: A Survey
- Optimal expansion of an existing network
- Optimal expansion of capacitated transshipment networks
- Optimal network configuration and capacity expansion of railroads
- Optimization of R\&D project portfolios under endogenous uncertainty
- Robust capacity planning in semiconductor manufacturing
- Stochastic capacity expansion with multiple sources of capacity
- The capacity expansion problem in the service industry
- The value of multistage stochastic programming in capacity planning under uncertainty
- Urban rapid transit network capacity expansion
Cited in
(9)- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty
- Revisiting Lagrangian relaxation for network design
- Lagrange dual bound computation for stochastic service network design
- Stochastic and minimum regret formulations for transmission network expansion planning under uncertainties
- A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- A Lagrangian relaxation approach for expansion of a highway network
- Delay reduction via Lagrange multipliers in stochastic network optimization
- Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales
This page was built for publication: A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288988)
