Pages that link to "Item:Q1751891"

The following pages link to The Benders decomposition algorithm: a literature review (Q1751891):

Displaying 50 items.

• Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
• Logic-based benders decomposition for an inter-modal transportation problem (Q2117232) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks (Q2147096) (← links)
• A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
• Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
• Optimizing rest times and differences in games played: an iterative two-phase approach (Q2163747) (← links)
• A linear ordering problem of sets (Q2173116) (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
• Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
• A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
• A class of Benders decomposition methods for variational inequalities (Q2191798) (← links)
• Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty (Q2239951) (← links)
• Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A robust disaster preparedness model for effective and fair disaster response (Q2273905) (← links)
• An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) (← links)
• Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
• Heat and electricity market coordination: a scalable complementarity approach (Q2294652) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
• Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
• Accelerating Benders decomposition: multiple cuts via multiple solutions (Q2424650) (← links)
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem (Q2661956) (← links)
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
• Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
• Railway disruption management: designing bus bridging services under uncertainty (Q2668706) (← links)
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• A Benders decomposition algorithm for demand-driven metro scheduling (Q2669703) (← links)
• Designing master surgery schedules with downstream unit integration via stochastic programming (Q2670515) (← links)
• Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Affine decision rule approximation to address demand response uncertainty in smart grids' capacity planning (Q2673591) (← links)
• Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
• (Q3758562) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
• Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
• Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
• Supply–demand hub in industrial clusters: a stochastic approach (Q5058908) (← links)
• Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events (Q5060797) (← links)
• Team Orienteering with Time-Varying Profit (Q5084650) (← links)