Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

Cited in

(only showing first 100 items - show all)

Accelerating the Benders decomposition method: application to stochastic network design problems
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Exact approaches to the single-source network loading problem
Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
Benders decomposition for the Hazmat transport network design problem
Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
On the impossibility of unambiguously selecting the best model for fitting data
Benders-and-cut algorithm for fixed-charge capacitated network design problem
Multiple allocation tree of hubs location problem for non-complete networks
Mathematical formulations for consistent travelling salesman problems
The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
Benders decomposition for network design covering problems
Hub location problems with price sensitive demands
The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
Design of survivable wireless backhaul networks with reliability considerations
Managing congestion in a multi-modal transportation network under biomass supply uncertainty
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm
A multi-stage stochastic integer programming approach for locating electric vehicle charging stations
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
Decomposition algorithms for the robust unidirectional quay crane scheduling problems
Exact approaches for integrated aircraft fleeting and routing at TunisAir
A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
A performance guarantee heuristic for electronic components placement problems including thermal effects
The production routing problem: a review of formulations and solution algorithms
Generalized Benders' decomposition for topology optimization problems
Scheduling medical residents' training at university hospitals
``Facet separation with one linear program
An integrated model for logistics network design
Mixed-integer bilinear programming problems
The ordered median tree location problem
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
Integrated investment, retrofit and abandonment energy system planning with multi-timescale uncertainty using stabilised adaptive Benders decomposition
Last fifty years of integer linear programming: a focus on recent practical advances
Benders decomposition algorithms for two variants of the single allocation hub location problem
Exploring the discrete and continuous edge improvement problems: models and algorithms
Meta partial Benders decomposition for the logistics service network design problem
A dual ascent approach for steiner tree problems on a directed graph
Benders decomposition for the discrete ordered median problem
The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
Practical enhancements to the Magnanti-Wong method
A New Scenario Reduction Method Based on Higher-Order Moments
Multiple allocation hub-and-spoke network design under hub congestion
Solving the optimum communication spanning tree problem
Stochastic optimization for power system configuration with renewable energy in remote areas
Convexity and optimization with copulæ structured probabilistic constraints
The Benders decomposition algorithm: a literature review
A Benders decomposition algorithm for the maximum availability service facility location problem
A unified approach to mixed-integer optimization problems with logical constraints
Benders decomposition for the uncapacitated multiple allocation hub location problem
Benders decomposition approach for the robust network design problem with flow bifurcations
Stabilized Benders decomposition for energy planning under climate uncertainty
Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
Accelerating Benders decomposition with heuristic master problem solutions
Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
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
Multicommodity flows and Benders decomposition for restricted continuous location problems
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
Service location grouping and pricing in transportation: application in air cargo
A robustness approach to uncapacitated network design problems
A demand-shifting feasibility algorithm for Benders decomposition.
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm
Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
A study on the optimal inventory allocation for clinical trial supply chains
Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
An integrated plant loading model with economies of scale and scope
A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
The hub location problem with market selection
Adjustable robust balanced hub location problem with uncertain transportation cost
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
Implementing automatic benders decomposition in a modern MIP solver
Yard truck retrofitting and deployment for hazardous material transportation in green ports
Robust critical node selection by Benders decomposition
A branch-and-price algorithm for the capacitated facility location problem
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
Optimal crashing of an activity network with disruptions
A Benders decomposition-based approach for logistics service network design
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
A novel Pareto-optimal cut selection strategy for Benders decomposition
A survey of network interdiction models and algorithms
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
Integer L-shaped and Lagrangian cuts revisited: a unified perspective

This page was built for publication: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904383)