This work studies the problem of designing, at minimal cost, a two-connected network such that each edge belongs to a cycle of bounded length: a problem which arises in the long-term planning of telecommunications networks. The book provides an in-depth study of the underlying polyhedron, proposing several classes of facet-defining inequalities that are used in a branch-and-cut algorithm. Several heuristics are also proposed in order to solve real-world instances of the problem, and extensive numerical results are reported. The polyhedral analysis is done in the best mathematical programming tradition. Results obtained here demonstrate how to use polyhedral theory for practical network design problems, and are therefore of interest for mathematical programming practitioners as an application of classical theoretical concepts. Moreover, telecommunications specialists can find practical solutions to real-world problems, as several heuristics are proposed that can be easily extended to related problems.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
`In summary, this is a good book to see how integer programming is used in real-life applications.'
Mathematical Reviews, 2001
List of Figures. List of Tables. Acknowledgements. 1. Introduction. 2. Survivable Network Design: A Survey. 3. Two-Connected Networks with Bounded Rings: The Model. 4. Polyhedral Study. 5. The Special Case of Rings with Bounded Cardinality. 6. A Branch-and-Cut Algorithm. 7. Heuristics. 8. Computational Results. 9. Conclusion. Appendices. References. Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 756580
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780792364146_new
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 756580-n
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 756580-n
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Studies the problem of designing, at minimal cost, a two-connected network such that each edge belongs to a cycle of bounded length. This book also studies the underlying polyhedron, proposing several classes of facet-defining inequalities that are used in a branch-and-cut algorithm. Series: Network Theory and Applications. Num Pages: 204 pages, 12 black & white illustrations, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 14. Weight in Grams: 1100. . 2000. Hardback. . . . . Codice articolo V9780792364146
Quantità: 15 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 756580
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 228. Codice articolo 263070315
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 228 Illus. Codice articolo 5858996
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 228. Codice articolo 183070305
Quantità: 4 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. Studies the problem of designing, at minimal cost, a two-connected network such that each edge belongs to a cycle of bounded length. This book also studies the underlying polyhedron, proposing several classes of facet-defining inequalities that are used in a branch-and-cut algorithm. Series: Network Theory and Applications. Num Pages: 204 pages, 12 black & white illustrations, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 14. Weight in Grams: 1100. . 2000. Hardback. . . . . Books ship from the US and Ireland. Codice articolo V9780792364146
Quantità: 15 disponibili