Concentrator Location in Telecommunications Networks

Hande Yaman

$260.95 $208.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer-Verlag New York Inc.
19 November 2004

Linear programming; Applied mathematics; Communications engineering & telecommunications

Series: Combinatorial Optimization

This book is the only recent title to present polyhedral results and exact solution methods for location problems encountered in telecommunications, but which also have applications in other areas, such as transportation and supply chain management.

By: Hande Yaman
Imprint: Springer-Verlag New York Inc.
Country of Publication: United States
Edition: 2005 ed.
Volume: 16
Dimensions: Height: 235mm, Width: 155mm, Spine: 17mm
Weight: 1.260kg
ISBN: 9780387235318
ISBN 10: 0387235310
Series: Combinatorial Optimization
Pages: 258
Publication Date: 19 November 2004
Audience: General/trade , Professional and scholarly , ELT Advanced , Undergraduate
Format: Hardback
Publisher's Status: Active

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.