Concentrator Location in Telecommunications Networks [electronic resource] / by Hande Yaman.

By: Yaman, Hande [author.]
Contributor(s): SpringerLink (Online service)
Material type: TextTextSeries: Combinatorial Optimization: 16Publisher: Boston, MA : Springer US, 2005Description: XVII, 258 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780387235325Subject(s): Mathematics | Applied mathematics | Engineering mathematics | Mathematical optimization | Operations research | Management science | Mathematics | Optimization | Operations Research, Management Science | Applications of MathematicsAdditional physical formats: Printed edition:: No titleDDC classification: 519.6 LOC classification: QA402.5-402.6Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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 research, telecommunications, location theory and integer programming.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

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 research, telecommunications, location theory and integer programming.

There are no comments for this item.

to post a comment.

Powered by Koha