Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) - Couverture souple

Orlin, James B.

Couverture souple

ISBN 10 : 1334017646 ISBN 13 : 9781334017643

Editeur : Forgotten Books, 2018

Synopsis

This book presents two efficient, polynomial-time algorithms for solving minimum cost network flow problems, a prevalent problem in network optimization with applications in areas such as logistics and telecommunications. The first algorithm, a modification of the Edmonds-Karp scaling technique, is genuinely polynomial, meaning the number of arithmetic operations it takes to find a solution is independent of the size of the input data. The second algorithm is a dual simplex algorithm that is also genuinely polynomial and may be implemented to run in time proportional to the Edmonds-Karp scaling technique. This book makes several contributions to the field of network optimization, including a new theoretical framework for analyzing the efficiency of minimum cost network flow algorithms and the development of new algorithms that are both theoretically and practically efficient.

Détails de l'édition

• Éditeur: Forgotten Books
• Date d'édition: 2018
• Langue: anglais
• ISBN 10: 1334017646
• ISBN 13: 9781334017643
• Reliure: Broché
• Nombre de pages: 48
• Coordonnées du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com; gpsr@podww.com; ; 9 Culley Court; Orton Southgate; Peterborough; Cambridgeshire; PE2 6WA; Royaume-Uni
• Personne responsable: Easy Access System Europe Oü, 16879218; +358405003575; gpsr.requests@easproject.com; ; Mustamäe tee 50; Tallinn; 10621; Estonie