The capacitated p-hub median problem with integral constraints: an application to a Chinese air cargo network
From MaRDI portal
Publication:450150
DOI10.1016/J.APM.2011.09.063zbMATH Open1246.90087OpenAlexW1970024794MaRDI QIDQ450150FDOQ450150
Jr-Yung Lin, Yin-Chieh Chen, Cheng-Chang Lin
Publication date: 13 September 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.063
Recommendations
- An Algorithm for Solving Capacitated Multicommodity p-median Transportation Problems
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A dual based heuristic for a hub-spoke air cargo network design problem with hop-count constraints
- A capacitated hub location problem in freight logistics multimodal networks
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- The budget constrained \(r\)-interdiction median problem with capacity expansion
Case-oriented studies in operations research (90B90) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- A quadratic integer program for the location of interacting hub facilities
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Composite Variable Formulations for Express Shipment Service Network Design
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
Cited In (15)
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- An efficient model for the multiple allocation hub maximal covering problem
- The hub location problem with market selection
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Proprietor and customer costs in the incomplete hub location-routing network topology
- Skyport location problem for urban air mobility system
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- A dual based heuristic for a hub-spoke air cargo network design problem with hop-count constraints
- An $$\alpha $$-risk appetite cost minimizing model for multi-commodity capacitated p-hub median problem with time windows and uncertain flows
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
This page was built for publication: The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450150)
