The hub location problem with market selection
From MaRDI portal
Publication:2027000
DOI10.1016/j.cor.2020.105136OpenAlexW3102439792MaRDI QIDQ2027000
Canrong Zhang, Zhongshun Shi, Tao Wu
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105136
heuristicsLagrangian relaxationmixed integer programmingBenders decompositionhub locationprofit-maximizing
Related Items
Uses Software
Cites Work
- Unnamed Item
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- Adapting polyhedral properties from facility to hub location problems
- The transfer point location problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- A quadratic integer program for the location of interacting hub facilities
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- Exact and heuristic approaches for the cycle hub location problem
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Exact solution of hub network design problems with profits
- Design of intermodal logistics networks with hub delays
- A competitive hub location and pricing problem
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A hub covering model for cargo delivery systems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- STACKELBERG HUB LOCATION PROBLEM
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines