Accelerating Benders decomposition by local branching
From MaRDI portal
Publication:2901070
Recommendations
- Accelerating Benders decomposition with heuristic master problem solutions
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- scientific article; zbMATH DE number 949665
- Benders decomposition: solving binary master problems by enumeration
- Tailoring Benders decomposition for uncapacitated network design
Cited in
(55)- Accelerating the Benders decomposition method: application to stochastic network design problems
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Exact approaches to the single-source network loading problem
- Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Generalized Benders' decomposition for topology optimization problems
- Scheduling medical residents' training at university hospitals
- Meta partial Benders decomposition for the logistics service network design problem
- Practical enhancements to the Magnanti-Wong method
- A New Scenario Reduction Method Based on Higher-Order Moments
- Improving Benders decomposition using a genetic algorithm
- The Benders decomposition algorithm: a literature review
- Benders decomposition for robust distribution network design and operations in online retailing
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- Accelerating Benders decomposition with heuristic master problem solutions
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
- Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management
- Implementing automatic benders decomposition in a modern MIP solver
- Decomposition based hybrid metaheuristics
- A Benders decomposition-based approach for logistics service network design
- 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
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- On generating maximal nondominated Benders cuts
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Recoverable robust single day aircraft maintenance routing problem
- 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
- A note on the selection of Benders' cuts
- Bounding, filtering and diversification in CP-based local branching
- A decomposition approach to the two-stage stochastic unit commitment problem
- The Benders dual decomposition method
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- A stochastic integer programming approach to air traffic scheduling and operations
- Accelerating Benders method using covering cut bundle generation
- A nested Benders decomposition approach for telecommunication network planning
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- An asynchronous parallel benders decomposition method for stochastic network design problems
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
- Recovery strategies from major supply disruptions in single and multiple sourcing networks
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for publication: Accelerating Benders decomposition by local branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901070)
