On carriers collaboration in hub location problems
From MaRDI portal
Publication:2286966
DOI10.1016/j.ejor.2019.11.038zbMath1431.90085OpenAlexW2990568058MaRDI QIDQ2286966
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.038
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Cites Work
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- On the collaboration uncapacitated arc routing problem
- Stochastic uncapacitated hub location
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- New formulations for the uncapacitated multiple allocation hub location problem
- A conditional \(p\)-hub location problem with attraction functions
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Planning models for freight transportation
- Location of hubs in a competitive environment
- The shared customer collaboration vehicle routing problem
- Exact and heuristic approaches for the cycle hub location problem
- Exact solution of hub network design problems with profits
- General network design: a unified view of combined location and network design problems
- A competitive hub location and pricing problem
- Service network design models for two-tier city logistics
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub network games
