Back to Search
Start Over
Improved formulations for the ring spur assignment problem
- Source :
- Lecture Notes in Computer Science, Lecture Notes in Computer Science, Springer, 2011, 6701 LNCS, pp.24-36, Lecture Notes in Computer Science ISBN: 9783642215261, INOC, INOC 2011, INOC 2011, 2011, Unknown, Unknown Region. pp.327-338
- Publication Year :
- 2011
- Publisher :
- HAL CCSD, 2011.
-
Abstract
- SCOPUS: cp.k; International audience; We present two complete integer programming formulations for the ring spur assignment problem. This problem arises in the design of next generation telecommunications networks. We analyse and compare the formulations in terms of compactness, the resulting LP bound and results from a branch and cut implementation. We present our conclusions with computational results. © 2011 Springer-Verlag.
- Subjects :
- Mathematical optimization
Ring (mathematics)
021103 operations research
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
Computer science
0211 other engineering and technologies
020206 networking & telecommunications
02 engineering and technology
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Compact space
0202 electrical engineering, electronic engineering, information engineering
Branch and cut
Algorithm
Assignment problem
Integer programming
Generalized assignment problem
Subjects
Details
- Language :
- English
- ISBN :
- 978-3-642-21526-1
- ISSN :
- 03029743
- ISBNs :
- 9783642215261
- Database :
- OpenAIRE
- Journal :
- Lecture Notes in Computer Science, Lecture Notes in Computer Science, Springer, 2011, 6701 LNCS, pp.24-36, Lecture Notes in Computer Science ISBN: 9783642215261, INOC, INOC 2011, INOC 2011, 2011, Unknown, Unknown Region. pp.327-338
- Accession number :
- edsair.doi.dedup.....9352c52ce47281d8618a8f85b2522f7a