Back to Search
Start Over
A branch and cut algorithm for hub location problems with single assignment
- Source :
- Mathematical Programming, Mathematical Programming, Springer Verlag, 2005, 102, pp.371-405
- Publication Year :
- 2005
- Publisher :
- Springer, 2005.
-
Abstract
- 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 transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.
- Subjects :
- Physics::Physics and Society
Mathematical optimization
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
General Mathematics
0211 other engineering and technologies
02 engineering and technology
Hub location problem
0502 economics and business
Polyhedral analysis
Single assignment
ComputingMilieux_MISCELLANEOUS
Mathematics
Hub location
050210 logistics & transportation
021103 operations research
Quantitative Biology::Molecular Networks
05 social sciences
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Computer Science::Social and Information Networks
Branch and cut
Terminal (electronics)
Routing (electronic design automation)
Algorithm
Assignment problem
Software
Subjects
Details
- Language :
- English
- ISSN :
- 00255610 and 14364646
- Database :
- OpenAIRE
- Journal :
- Mathematical Programming, Mathematical Programming, Springer Verlag, 2005, 102, pp.371-405
- Accession number :
- edsair.doi.dedup.....2a93285724577b4f2bd2387050b1d054