๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Single-assignment hub location problems with multiple capacity levels

โœ Scribed by Isabel Correia; Stefan Nickel; Francisco Saldanha-da-Gama

Book ID
116937570
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
392 KB
Volume
44
Category
Article
ISSN
0191-2615

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and cut algorithm for hub locat
A branch and cut algorithm for hub location problems with single assignment
โœ Martine Labbรฉ; Hande Yaman; Eric Gourdin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra

Exactly solving a two-level location pro
Exactly solving a two-level location problem with modular node capacities
โœ Bernardetta Addis; Giuliana Carello; Alberto Ceselli ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB

## Abstract In many telecommunication networks, a given set of client nodes must be served by different sets of facilitiesโ€”providing different services and having different capabilitiesโ€”which must be located and dimensioned in the design phase. Network topology must be designed as well, by assignin