Concentrator Location in Telecommunications Networks

The author presents polyhedral results and exact solution methods for location problems encountered in telecommunications but which also have applications in other areas like transportation and supply chain management. Audience This volume is suitable for researchers and practitioners in operations...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר ראשי: Yaman, Hande
פורמט: Livre numérique
שפה:Anglais
יצא לאור: New York, NY : Springer US [20..].
Cham : Springer Nature
מהדורה:1st ed. 2005.
סדרה:Combinatorial Optimization 16
גישה מקוונת:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
הערה: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Concentrator Location in Telecommunications Networks, Texte imprimé, 9780387235318
• Neural and synergetic computers, proceedings of the International Symposium at Schloss Elmau, Bavaria, June 13-17, 1988, Hermann Haken, ed, Berlin, Springer-Verlag, 1988, 1 vol. (VIII-263 p.), Springer series in synergetics, 0-387-50339-0
• Concentrator Location in Telecommunications Networks, Texte imprimé, 9780387235318
• Concentrator Location in Telecommunications Networks, Texte imprimé, 9781461498520
• Neural and synergetic computers, proceedings of the International Symposium at Schloss Elmau, Bavaria, June 13-17, 1988, Hermann Haken, ed, Berlin, Springer-Verlag, 1988, 1 vol. (VIII-263 p.), Springer series in synergetics, 0-387-50339-0
• Concentrator Location in Telecommunications Networks, Texte imprimé, 9780387235318
• Concentrator Location in Telecommunications Networks, Texte imprimé, 9781461498520
תוכן הענינים:
  • Problem Definition and Survey A Survey on Location Problems with Applications in Telecommunications QCL-C: Relaxations and Special Cases Polyhedral Analysis Uncapacitated Problems Problems with Linear Capacity Constraints Problems with Quadratic Capacity Constraints Summary of Results of Part II Solving QCL-C with Branch and Cut QCL-C: Formulations and Projection Inequalities Branch and Cut Algorithm for QCL-C Conclusion