Accelerating Benders method using covering cut bundle generation
From MaRDI portal
Publication:3563624
DOI10.1111/j.1475-3995.2009.00706.xzbMath1279.90072OpenAlexW2047577782MaRDI QIDQ3563624
Georges K. Saharidis, Marianthi Ierapetritou, Michel Minoux
Publication date: 31 May 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00706.x
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items
A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Supply–demand hub in industrial clusters: a stochastic approach, Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Investigating volatility transmission across international equity markets using multivariate fractional models, Systematic reviews as a metaknowledge tool: caveats and a review of available options, Model building using bi-level optimization, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Design of survivable wireless backhaul networks with reliability considerations, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, Speed-up Benders decomposition using maximum density cut (MDC) generation, Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, Multicut Benders decomposition algorithm for process supply chain planning under uncertainty, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, Optimal engineering design via Benders' decomposition, Estimating the parameters of a fatigue model using Benders' decomposition, A decomposition approach for solving a broadcast domination network design problem, A decomposition approach to the two-stage stochastic unit commitment problem, Stochastic optimization for power system configuration with renewable energy in remote areas, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, The Benders decomposition algorithm: a literature review, Benders decomposition for the Hazmat transport network design problem, Regularized decomposition of large scale block-structured robust optimization problems, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Convexity and optimization with copulæ structured probabilistic constraints, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Cites Work
- Unnamed Item
- Hydro energy management optimization in a deregulated electricity market
- Partitioning procedures for solving mixed-variables programming problems
- Exact solution of multicommodity network optimization problems with general step cost functions
- Discrete cost multicommodity network optimization problems and exact solution methods
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solution approaches to large shift scheduling problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A Comparative Analysis of Various Optimization Models for Electricity Capacity Expansion
- Inexact Cuts in Benders Decomposition
