The stochastic capacitated branch restructuring problem

DOI10.1007/S10479-014-1730-3zbMATH Open1357.90102DBLPjournals/anor/Ruiz-HernandezD16OpenAlexW2015795588WikidataQ57500141 ScholiaQ57500141MaRDI QIDQ512982FDOQ512982

David Delgado-Gómez, Diego Ruiz-Hernández

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1730-3

Recommendations

• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• On capacitated stochastic chain problems in a network
• BRANCH-AND-BOUND APPROACH FOR A STOCHASTIC PRODUCTION PLANNING PROBLEM WITH CAPACITY CONSTRAINTS
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems
• A branch-and-price approach for the stochastic generalized assignment problem
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
• Stochastic programs over trees with random arc capacities
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Solving a class of stochastic mixed-integer programs with branch and price

zbMATH Keywords

uncertaintystochastic programmingcapacitated facility locationmergersdelocationacquisitionstwo-stage recourse

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Cites Work

• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
• An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
• Introduction to Stochastic Programming
• Title not available (Why is that?)
• The Location of Emergency Service Facilities
• LP-based approximation algorithms for capacitated facility location
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
• On a fix-and-relax framework for a class of project scheduling problems
• Variable neighborhood decomposition search
• Budget constrained location problem with opening and closing of facilities.
• The capacitated plant location problem
• Evaluating bank branch location and performance: A case study
• The three-hierarchical location-allocation of banking facilites with risk and uncertainty
• Locating and sizing bank-branches by opening, closing or maintaining facilities
• A Hierarchical Location Model for Locating Bank Branches in a Competitive Environment
• Optimal shrinking of the distribution chain: the facilities delocation decision
• Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs

Cited In (4)

• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
• The hierarchical model of branch planning with random coefficients
• Locating and sizing bank-branches by opening, closing or maintaining facilities
• Branch Network and Modular Service Optimization for Community Banking

This page was built for publication: The stochastic capacitated branch restructuring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512982)