Accelerating Benders Decomposition by Local Branching
From MaRDI portal
Publication:2901070
DOI10.1287/ijoc.1080.0296zbMath1243.90122OpenAlexW2129946839MaRDI QIDQ2901070
Michel Gendreau, Patrick Soriano, Jean-François Cordeau, Walter Rei
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0296
Related Items
Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage, Exact approaches to the single-source network loading problem, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Decomposition based hybrid metaheuristics, Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition, Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles, Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels, A note on the selection of Benders' cuts, Recoverable robust single day aircraft maintenance routing problem, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, A Benders decomposition-based approach for logistics service network design, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A New Scenario Reduction Method Based on Higher-Order Moments, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, Speed-up Benders decomposition using maximum density cut (MDC) generation, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, A decomposition approach to the two-stage stochastic unit commitment problem, Recovery strategies from major supply disruptions in single and multiple sourcing networks, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, The Benders Dual Decomposition Method, Generalized Benders' decomposition for topology optimization problems, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Accelerating benders decomposition with heuristicmaster problem solutions, Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management, The Benders decomposition algorithm: a literature review, Scheduling medical residents' training at university hospitals, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning, A nested benders decomposition approach for telecommunication network planning, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, An improved L-shaped method for solving process flexibility design problems, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Improving Benders decomposition using a genetic algorithm, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning, Meta partial Benders decomposition for the logistics service network design problem
