Pages that link to "Item:Q2901070"

The following pages link to Accelerating Benders Decomposition by Local Branching (Q2901070):

Displaying 49 items.

• Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
• Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
• Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
• Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← links)
• Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
• The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Scheduling medical residents' training at university hospitals (Q1755256) (← links)
• An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
• Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning (Q2005795) (← links)
• Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
• A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
• Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management (Q2245685) (← links)
• Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand (Q2253993) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
• On generating maximal nondominated Benders cuts (Q2442075) (← links)
• Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
• A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
• A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• A nested benders decomposition approach for telecommunication network planning (Q3588806) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
• Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty (Q5085475) (← links)
• A New Scenario Reduction Method Based on Higher-Order Moments (Q5106389) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation (Q6163589) (← links)
• Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm (Q6164624) (← links)
• An asynchronous parallel benders decomposition method for stochastic network design problems (Q6551056) (← links)
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
• Benders decomposition for robust distribution network design and operations in online retailing (Q6586233) (← links)