Publication:3147668
From MaRDI portal
zbMath1061.90069MaRDI QIDQ3147668
Mohan Krishnamoorthy, Andreas T. Ernst, James F. Campbell
Publication date: 2002
90B80: Discrete location and assignment
Related Items
Adapting polyhedral properties from facility to hub location problems, New formulations for the uncapacitated multiple allocation hub location problem, An exact solution procedure for a cluster hub location problem, Locating landfills--optimization vs. reality, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, Hub-and-spoke network design with congestion, A branch and cut algorithm for hub location problems with single assignment, Location analysis: a synthesis and survey, Threshold based discounting networks: the cost allocation provided by the nucleolus, A cost allocation problem arising in hub-spoke network systems, Formulating and solving splittable capacitated multiple allocation hub location problems, Solving the hub location problem with modular link capacities, A hub covering model for cargo delivery systems, SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM