Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
From MaRDI portal
Publication:2294760
Recommendations
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Solving a capacitated hub location problem
- HUBBI: iterative network design for incomplete hub location problems
- Benders decomposition algorithms for two variants of the single allocation hub location problem
Cites work
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A note on the selection of Benders' cuts
- A quadratic integer program for the location of interacting hub facilities
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An improved Benders decomposition algorithm for the tree of hubs location problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
- Benders decomposition for large-scale uncapacitated hub location
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Extreme points of Leontief substitution systems
- General network design: a unified view of combined location and network design problems
- Generalized Benders decomposition
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 3495849 (Why is no real title available?)
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub network design with single and multiple allocation: A computational study
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- Integrated airline scheduling
- Leontief Substitution Systems and Matroid Complexes
- Multicommodity Distribution System Design by Benders Decomposition
- Network hub location problems: The state of the art
- Partitioning procedures for solving mixed-variables programming problems
- Polyhedral Characterization of Discrete Dynamic Programming
- Practical enhancements to the Magnanti-Wong method
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Stochastic uncapacitated hub location
- Tailoring Benders decomposition for uncapacitated network design
- The Benders decomposition algorithm: a literature review
- The tree of hubs location problem
- Totally unimodular Leontief directed hypergraphs
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Cited in
(11)- Upgrading nodes in tree-shaped hub location
- 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
- 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
- The uncapacitated hub location problem in networks under decentralized management
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Double-layer Benders decomposition for large-scale robust uncapacitated hub location
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
This page was built for publication: Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294760)
