Practical enhancements to the Magnanti-Wong method

DOI10.1016/j.orl.2008.01.005zbMath1155.90432OpenAlexW1992713772MaRDI QIDQ1003493

Nikolaos Papadakos

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.01.005

zbMATH Keywords

accelerated Benders decompositionBenders cut dominanceMagnanti-Wong algorithmPareto-optimal cut

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Related Items (63)

Hub location problems with price sensitive demands ⋮ 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 ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ Supply–demand hub in industrial clusters: a stochastic approach ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition ⋮ Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels ⋮ Recoverable robust single day aircraft maintenance routing problem ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ Enhancing Benders decomposition algorithm to solve a combat logistics problem ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ 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 ⋮ Benders decomposition for the mixed no-idle permutation flowshop scheduling problem ⋮ An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ On generating maximal nondominated Benders cuts ⋮ 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 ⋮ Stochastic optimization for power system configuration with renewable energy in remote areas ⋮ 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 ⋮ The Benders Dual Decomposition Method ⋮ 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 ⋮ The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ Accelerating benders decomposition with heuristicmaster problem solutions ⋮ 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 column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Solving the optimum communication spanning tree problem ⋮ The Benders decomposition algorithm: a literature review ⋮ Stochastic survivable network design problems: theory and practice ⋮ 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 ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ 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 ⋮ 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 ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Refined cut selection for Benders decomposition: applied to network capacity expansion problems ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots ⋮ ``Facet separation with one linear program ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning

Cites Work

• An integrated aircraft routing, crew scheduling and flight retiming model
• Integrated airline scheduling
• Partitioning procedures for solving mixed-variables programming problems
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• A stochastic programming approach for supply chain network design under uncertainty
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• Integrated Airline Fleeting and Crew-Pairing Decisions
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Unnamed Item

This page was built for publication: Practical enhancements to the Magnanti-Wong method