Computational Techniques of the Simplex Method. Questo articolo non è disponibile.
Lingua: inglese
Editore: Springer, 2012
Serie: Libro 46 di 323 - International Series in Operations Research & Management Science
- Brossura
- Nuovo

Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Venditore con 5 stelle
Venditore AbeBooks dal 6 aprile 2009
Non disponibile
Brossura
Condizione: Nuovo
EUR 286,39
Codice articolo 19490333-n
- Titolo
- Computational Techniques of the Simplex Method
- Autore
- Maros, István
- Editore
- Springer
- Anno di pubblicazione
- 2012
- Condizione
- New
- Rilegatura
- Brossura
- Lingua
- inglese
- ISBN 10
- 1461349907
- ISBN 13
- 9781461349907
- Serie
- Libro 46 di 323: International Series in Operations Research & Management Science
Computational Techniques of the Simplex Method is a systematic treatment focused on the computational issues of the simplex method. It provides a comprehensive coverage of the most important and successful algorithmic and implementation techniques of the simplex method. It is a unique source of essential, never discussed details of algorithmic elements and their implementation. On the basis of the book the reader will be able to create a highly advanced implementation of the simplex method which, in turn, can be used directly or as a building block in other solution algorithms.
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Recensione
"This is really a nice, long awaited book...it covers all important aspects and techniques needed for an efficient, robust implementation of the simplex method...it deserves a place on the bookshelf of every OR, optimization professional, it could be marketed as "handbook of computational techniques"."
(Tamás Terlaky, Dept. of Computing and Software, McMaster University, Hamilton, ON, Canada)
"The book will be of great interest to people developing advanced LP solver codes customized for special purposes, and solvers for integer programming and combinatorial optimization, and also for researchers working in these areas. It is an ideal textbook for graduate courses in computational mathematical programming. It deserves to be in the personal library of software engineers dealing with numerical computation involving linear constraints."
(K.G. Murty, for the American Mathematical Society, MathSciNet Mathematical Reviews on the web)
(Tamás Terlaky, Dept. of Computing and Software, McMaster University, Hamilton, ON, Canada)
"The book will be of great interest to people developing advanced LP solver codes customized for special purposes, and solvers for integer programming and combinatorial optimization, and also for researchers working in these areas. It is an ideal textbook for graduate courses in computational mathematical programming. It deserves to be in the personal library of software engineers dealing with numerical computation involving linear constraints."
(K.G. Murty, for the American Mathematical Society, MathSciNet Mathematical Reviews on the web)
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.