Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Concentrator Location in Telecommunications Networks

By: Yaman, Hande [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Combinatorial Optimization: 16Publisher: Boston, MA : Springer US, 2005.Description: XVII, 258 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387235325.Subject(s): Mathematics | Applied mathematics | Engineering mathematics | Mathematical optimization | Operations research | Management science | Mathematics | Optimization | Operations Research, Management Science | Applications of MathematicsDDC classification: 519.6 Online 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.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK6216
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.

Log in to your account to post a comment.

Powered by Koha