Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
From MaRDI portal
Publication:3904383
DOI10.1287/opre.29.3.464zbMath0455.90064OpenAlexW2086522200MaRDI QIDQ3904383
Richard T. Wong, Thomas L. Magnanti
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.3.464
Related Items
Implementing Automatic Benders Decomposition in a Modern MIP Solver, Exact approaches to the single-source network loading problem, A survey of variants and extensions of the location-routing problem, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution, A note on the selection of Benders' cuts, Solving a capacitated hub location problem, An integrated plant loading model with economies of scale and scope, Benders Decomposition for Production Routing Under Demand Uncertainty, Uncontrolled inexact information within bundle methods, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, Single Allocation Hub Location with Heterogeneous Economies of Scale, Benders decomposition approach for the robust network design problem with flow bifurcations, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Benders decomposition for a period-aggregated resource leveling problem with variable job duration, Multiple allocation tree of hubs location problem for non-complete networks, Benders decomposition for network design covering problems, A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem, A Benders decomposition algorithm for demand-driven metro scheduling, A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem, Affine decision rule approximation to address demand response uncertainty in smart grids' capacity planning, Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem, Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm, Large‐scale zone‐based evacuation planning—Part I: Models and algorithms, A New Scenario Reduction Method Based on Higher-Order Moments, A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Accelerating Benders decomposition: multiple cuts via multiple solutions, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, Design of survivable wireless backhaul networks with reliability considerations, Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm, An efficient Benders decomposition for the \(p\)-median problem, Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems, LP extreme points and cuts for the fixed-charge network design problem, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, 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, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, A decomposition approach to the two-stage stochastic unit commitment problem, Stochastic optimization for power system configuration with renewable energy in remote areas, The Benders Dual Decomposition Method, Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Dynamic-demand capacitated facility location problems with and without relocation, Accelerating benders decomposition with heuristicmaster problem solutions, Accelerating Benders method using covering cut bundle generation, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, A dual ascent approach for steiner tree problems on a directed graph, A stochastic programming approach for supply chain network design under uncertainty, A nested benders decomposition approach for telecommunication network planning, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network, A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations, A Benders decomposition approach for the robust spanning tree problem with interval data, A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems, Optimizing over pure stationary equilibria in consensus stopping games, Simultaneous fleet assignment and cargo routing using Benders decomposition, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Robust Critical Node Selection by Benders Decomposition, A survey of network interdiction models and algorithms, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, A multi-stage stochastic integer programming approach for locating electric vehicle charging stations, Convexity and optimization with copulæ structured probabilistic constraints, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, On the impossibility of unambiguously selecting the best model for fitting data, ``Facet separation with one linear program, Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs, Hub location problems with price sensitive demands, On using approximations of the Benders master problem, Multiple allocation hub-and-spoke network design under hub congestion, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Single-commodity robust network design with finite and hose demand sets, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints, Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition, Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles, Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels, Benders decomposition without separability: a computational study for capacitated facility location problems, A Benders decomposition-based matheuristic for the cardinality constrained shift design problem, Optimal crashing of an activity network with disruptions, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Recoverable robust single day aircraft maintenance routing problem, The production routing problem: a review of formulations and solution algorithms, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Combining Benders decomposition and column generation for multi-activity tour scheduling, A mixed-integer programming approach for locating jamming devices in a flow-jamming attack, Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain, A branch-and-price algorithm for the capacitated facility location problem, An integrated model for logistics network design, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, An integrated aircraft routing, crew scheduling and flight retiming model, Enhancing Benders decomposition algorithm to solve a combat logistics problem, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption, A Benders decomposition-based approach for logistics service network design, A two-stage stochastic programming approach for multi-activity tour scheduling, Model building using bi-level optimization, Benders decomposition for the mixed no-idle permutation flowshop scheduling problem, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, Recovery strategies from major supply disruptions in single and multiple sourcing networks, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, Benders decomposition for very large scale partial set covering and maximal covering location problems, Generalized Benders' decomposition for topology optimization problems, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Exact and heuristic solution approaches for the mixed integer setup knapsack problem, Locational analysis, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, Managing congestion in a multi-modal transportation network under biomass supply uncertainty, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, Benders decomposition for the uncapacitated multiple allocation hub location problem, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Scheduled service network design with resource management for two-tier multimodal city logistics, Integrated airline scheduling, A two-stage stochastic programming approach for influence maximization in social networks, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing, The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT), Solving the optimum communication spanning tree problem, A study on the optimal inventory allocation for clinical trial supply chains, The Benders decomposition algorithm: a literature review, Stochastic survivable network design problems: theory and practice, A new cross decomposition method for stochastic mixed-integer linear programming, Mixed-integer bilinear programming problems, Multicommodity flows and Benders decomposition for restricted continuous location problems, Service location grouping and pricing in transportation: application in air cargo, Benders decomposition for the Hazmat transport network design problem, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Scheduling medical residents' training at university hospitals, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning, Benders decomposition algorithms for two variants of the single allocation hub location problem, Exact approaches for integrated aircraft fleeting and routing at TunisAir, A survey on Benders decomposition applied to fixed-charge network design problems, A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Exact solution algorithms for the maximum flow problem with additional conflict constraints, A performance guarantee heuristic for electronic components placement problems including thermal effects, The hub location problem with market selection, Adjustable robust balanced hub location problem with uncertain transportation cost, Benders decomposition: solving binary master problems by enumeration, Accelerating Benders decomposition for short-term hydropower maintenance scheduling, Capacitated multi-period maximal covering location problem with server uncertainty, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, Transmission network investment using incentive regulation: a disjunctive programming approach, A new formulation and an exact approach for the many-to-many hub location-routing problem, An improved L-shaped method for solving process flexibility design problems, Practical enhancements to the Magnanti-Wong method, A demand-shifting feasibility algorithm for Benders decomposition., A robustness approach to uncapacitated network design problems, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, Benders-and-cut algorithm for fixed-charge capacitated network design problem, A comparison of two dual-based procedures for solving the p-median problem, Capital budgeting with Benders' decomposition, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, A Benders decomposition algorithm for the maximum availability service facility location problem, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning, Meta partial Benders decomposition for the logistics service network design problem
