9781332260775 - faster parametric shortest path and minimum balance algorithms (classic reprint) di young, neal e. (3 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,52
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,36
EUR 3,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Altre immagini
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,41
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book approaches two interrelated problems prevalent in network optimization: finding the shortest path and achieving minimum balance. In the first part, the author develops a parametric shortest path algorithm with improved time complexity, enhancing the practicality of this fund…amental technique. In the second part, this algorithm is combined with a method for minimum balance, resulting in a faster algorithm for this important problem. The book's insights will be of significant interest to researchers and practitioners working in network optimization, offering both theoretical advancements and practical tools for solving complex network problems more efficiently. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
