Pages that link to "Item:Q2442081"

The following pages link to An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081):

Displayed 14 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)
• Integrated strategic and tactical supply chain planning with price-sensitive demands (Q324319) ‎ (← links)
• Multi-neighborhood local search optimization for machine reassignment problem (Q342289) ‎ (← links)
• The stochastic capacitated branch restructuring problem (Q512982) ‎ (← 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)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) ‎ (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) ‎ (← links)
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) ‎ (← 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)