A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty

DOI10.1016/J.COR.2011.11.006zbMath1251.90239OpenAlexW2001781054MaRDI QIDQ1761157

Antonio Alonso-Ayuso, Monique Guignard, Fernanda Bravo, Vladimir Marianov, Patricio Hernández, Laureano Fernando Escudero Bueno, Andrés P. Weintraub

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/129311

zbMATH Keywords

stochastic integer programmingbranch-and-fix coordinationmulti-period scenario treeprison facility location

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (8)

BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ A multi-objective bi-level location planning problem for stone industrial parks ⋮ Optimizing vaccine distribution in developing countries under natural disaster risk ⋮ Integrated facility location and capacity planning under uncertainty ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Simple dynamic location problem with uncertainty: a primal-dual heuristic approach ⋮ On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems

Uses Software

• CPLEX
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a stochastic sequencing and scheduling problem
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
• Partitioning procedures for solving mixed-variables programming problems
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Dual decomposition in stochastic integer programming
• Stochastic programming with integer variables
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
• Lagrangean relaxation. (With comments and rejoinder).
• A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• The million-variable ``march for stochastic combinatorial optimization
• Stochastic decomposition. A statistical method for large scale stochastic linear programming
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
• Introduction to Stochastic Programming
• Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile

This page was built for publication: A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty