Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
From MaRDI portal
Publication:2294760
DOI10.1016/j.apm.2017.06.035zbMath1480.90162OpenAlexW2733581602MaRDI QIDQ2294760
Morton E. O'Kelly, Ricardo S. de Camargo, James F. Campbell, Gilberto~jun. de Miranda
Publication date: 12 February 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2017.06.035
hub location problemsBenders decomposition methodhub and spoke networksimproved benders feasibility cutsLeontief flow substitution systems
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Upgrading nodes in tree-shaped hub location, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Planning and design of intermodal hub networks: a literature review, Multiple allocation tree of hubs location problem for non-complete networks, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, HUBBI: iterative network design for incomplete hub location problems, Perspectives on modeling hub location problems, The capacitated directed cycle hub location and routing problem under congestion
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic uncapacitated hub location
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- Integrated airline scheduling
- Practical enhancements to the Magnanti-Wong method
- An improved Benders decomposition applied to a multi-layer network design problem
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Partitioning procedures for solving mixed-variables programming problems
- The Benders decomposition algorithm: a literature review
- 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 new formulation and an exact approach for the many-to-many hub location-routing problem
- Totally unimodular Leontief directed hypergraphs
- General network design: a unified view of combined location and network design problems
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
- Network hub location problems: The state of the art
- Extreme points of Leontief substitution systems
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Polyhedral Characterization of Discrete Dynamic Programming
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Tailoring Benders decomposition for uncapacitated network design
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Leontief Substitution Systems and Matroid Complexes
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
