Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Practical enhancements to the Magnanti-Wong method
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- A comparison of two dual-based procedures for solving the p-median problem
- Capital budgeting with Benders' decomposition
- Locational analysis
- A robustness approach to uncapacitated network design problems
- On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
- On using approximations of the Benders master problem
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- 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
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- A two-stage stochastic programming approach for multi-activity tour scheduling
- 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
- 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
- A two-stage stochastic programming approach for influence maximization in social networks
- 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
- 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 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
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Benders decomposition: solving binary master problems by enumeration
- 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
- A demand-shifting feasibility algorithm for Benders decomposition.
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- Solving the optimum communication spanning tree problem
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- 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 solution algorithms for the maximum flow problem with additional conflict constraints
- 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
- Transmission network investment using incentive regulation: a disjunctive programming approach
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- A Benders decomposition algorithm for the maximum availability service facility location problem
- Meta partial Benders decomposition for the logistics service network design problem
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Optimal crashing of an activity network with disruptions
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- 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
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- Scheduled service network design with resource management for two-tier multimodal city logistics
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
- A study on the optimal inventory allocation for clinical trial supply chains
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Optimizing over pure stationary equilibria in consensus stopping games
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
- 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
- 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
- Solving a capacitated hub location problem
- Uncontrolled inexact information within bundle methods
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- 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
- A stochastic programming approach for supply chain network design under uncertainty
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Simultaneous fleet assignment and cargo routing using Benders decomposition
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- A survey of variants and extensions of the location-routing problem
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- A note on the selection of Benders' cuts
- An integrated plant loading model with economies of scale and scope
- Hub location problems with price sensitive demands
- 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
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)
