Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem

DOI10.1007/S11590-019-01401-4MaRDI QIDQ2300645zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Benders decompositionLagrangian relaxationbranch and pricetwo-stage stochastic facility location and network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic programming (90C15) Discrete location and assignment (90B80)

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

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• 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
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
• A generic stochastic model for supply-and-return network design
• A new cross decomposition method for stochastic mixed-integer linear programming
• A two-stage stochastic programming framework for transportation planning in disaster response
• An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
• An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
• Cross decomposition for mixed integer programming
• Decomposition algorithms for two-stage chance-constrained programs
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• Implementing Mixed Integer Column Generation
• Introduction to stochastic programming.
• Risk-averse two-stage stochastic programming with an application to disaster management
• Service network design in freight transportation
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The multidimensional 0-1 knapsack problem: an overview.
• Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design

Cited in

(2)

• An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem

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)