The following pages link to (Q3147668):
Displayed 14 items.
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- An exact solution procedure for a cluster hub location problem (Q859914) (← links)
- Locating landfills--optimization vs. reality (Q864021) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Hub-and-spoke network design with congestion (Q1764770) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Threshold based discounting networks: the cost allocation provided by the nucleolus (Q1779541) (← links)
- A cost allocation problem arising in hub-spoke network systems (Q1885769) (← links)
- Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- A hub covering model for cargo delivery systems (Q3418120) (← links)
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM (Q3421858) (← links)