The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach (original) (raw)
Related papers
Heuristic Solution for the p-hub Problem
Wseas Transactions on Mathematics, 2013
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming, 2005
A multi-start heuristic for the design of hub-and-spoke networks
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, 2017
Lagrangean Relaxation for the Capacitated Hub Location Problem with Single Assignment
Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm
arXiv (Cornell University), 2017
A linear program for the two-hub location problem
European Journal of Operational Research, 1997
A branch-and-cut algorithm for the partitioning-hub location-routing problem
Computers & Operations Research, 2011
The capacitated multiple allocation hub location problem: Formulations and algorithms
2000
Benders decomposition for the uncapacitated multiple allocation hub location problem
Computers & Operations Research, 2008
The hub location and routing problem
European Journal of Operational Research, 1995
IOP Conference Series: Materials Science and Engineering, 2018
Operational Research, 2018
Computational Optimization and Applications, 2008
Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm
2015
Solving the Hub location problem in telecommunication network design: A local search approach
Networks, 2004
Designing incomplete hub location-routing network in urban transportation problem
International Journal of Engineering-Transactions C: Aspects, 2013
An Exact Solution for the Capacitated Multiple Allocation Hub Location Problem
Journal of Computational Interdisciplinary Sciences, 2013
eng.uwaterloo.ca
An evolutionary-based approach for solving a capacitated hub location problem
Applied Soft Computing, 2011
2008
Bi-objective p-hub Location Problems by Fatih Bilen
2017
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
INFORMS Journal on Computing, 2011
Hub Covering Location Problem under Capacity Constraints
2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation, 2010
A Relax-and-Decomposition Algorithm for a p-Robust Hub Location Problem
arXiv: Optimization and Control, 2017
A GENERAL MIXED-INTEGER NONLINEAR OPTIMIZATION MODEL FOR HUB NETWORK DESIGN
Solving the uncapacitated hub location problem using genetic algorithms
Computers and Operations Research, 2005
Graph based approach to the minimum hub problem in transportation network
Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015