Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
DOI10.1007/S11590-019-01401-4zbMATH Open1433.90081OpenAlexW2913674600MaRDI QIDQ2300645FDOQ2300645
Authors: Amin Hosseininasab, Fatma Gzara 
Publication date: 27 February 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01401-4
Recommendations
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- scientific article; zbMATH DE number 1189254
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- New facets for the two-stage uncapacitated facility location polytope
Benders decompositionLagrangian relaxationbranch and pricetwo-stage stochastic facility location and network flow
Deterministic network models in operations research (90B10) Stochastic programming (90C15) Discrete location and assignment (90B80)
Cites Work
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- A two-stage stochastic programming framework for transportation planning in disaster response
- Risk-averse two-stage stochastic programming with an application to disaster management
- Introduction to stochastic programming.
- Implementing Mixed Integer Column Generation
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Decomposition algorithms for two-stage chance-constrained programs
- Cross decomposition for mixed integer programming
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Service network design in freight transportation
- A generic stochastic model for supply-and-return network design
- The multidimensional 0-1 knapsack problem: an overview.
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
- A new cross decomposition method for stochastic mixed-integer linear programming
- Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
Cited In (2)
This page was built for publication: Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300645)
