This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
"Sinopsis" puede pertenecer a otra edición de este libro.
Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 28,97 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Mispah books, Redhill, SURRE, Reino Unido
cd_rom. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA80035402045636
Cantidad disponible: 1 disponibles