A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
From MaRDI portal
Publication:5095157
DOI10.1287/opre.2020.2032zbMath1494.90019OpenAlexW4221018363MaRDI QIDQ5095157
Mohan Krishnamoorthy, Andreas T. Ernst, Andrew Perrykkad
Publication date: 5 August 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2032
Uses Software
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- A tabu search heuristic for the inland container transportation problem
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- The multi-shift vehicle routing problem with overtime
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Geometric three-dimensional assignment problems
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Geometric versions of the three-dimensional assignment problem under general norms
- The Benders decomposition algorithm: a literature review
- Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal
- ``Facet separation with one linear program
- A truck scheduling problem arising in intermodal container transportation
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- On generating maximal nondominated Benders cuts
- A note on the selection of Benders' cuts
- Vehicle Routing
- The multi-trip vehicle routing problem
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- Reducibility among Combinatorial Problems
- The Generalized Assignment Problem and Extensions
- Optimization of the drayage problem using exact methods
This page was built for publication: A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
