Pages that link to "Item:Q2442075"

The following pages link to On generating maximal nondominated Benders cuts (Q2442075):

Displaying 28 items.

• Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
• Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
• Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
• Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
• Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← 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)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
• An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
• Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
• An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Accelerating Benders decomposition: multiple cuts via multiple solutions (Q2424650) (← links)
• Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← links)
• Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• Supply–demand hub in industrial clusters: a stochastic approach (Q5058908) (← links)
• A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• Large‐scale zone‐based evacuation planning—Part I: Models and algorithms (Q6087069) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs (Q6112748) (← links)
• An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation (Q6163589) (← links)