Pages that link to "Item:Q3563624"
From MaRDI portal
The following pages link to Accelerating Benders method using covering cut bundle generation (Q3563624):
Displayed 31 items.
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- Model building using bi-level optimization (Q620522) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← 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)
- Benders decomposition for the Hazmat transport network design problem (Q1754275) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements (Q1928308) (← links)
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← links)
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← 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)
- Optimal engineering design via Benders' decomposition (Q2442087) (← links)
- Estimating the parameters of a fatigue model using Benders' decomposition (Q2442091) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
- Stochastic optimization for power system configuration with renewable energy in remote areas (Q2442098) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)