Graph Theory and Combinatorial Optimization
Editat de David Avis, Alain Hertz, Odile Marcotteen Limba Engleză Paperback – 29 oct 2010
Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 678.95 lei 43-57 zile | |
Springer Us – 29 oct 2010 | 678.95 lei 43-57 zile | |
Hardback (1) | 635.23 lei 43-57 zile | |
Springer Us – 28 apr 2005 | 635.23 lei 43-57 zile |
Preț: 678.95 lei
Preț vechi: 798.77 lei
-15% Nou
Puncte Express: 1018
Preț estimativ în valută:
129.93€ • 135.37$ • 108.03£
129.93€ • 135.37$ • 108.03£
Carte tipărită la comandă
Livrare economică 10-24 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781441938114
ISBN-10: 1441938117
Pagini: 284
Ilustrații: XVI, 266 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of hardcover 1st ed. 2005
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 1441938117
Pagini: 284
Ilustrații: XVI, 266 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of hardcover 1st ed. 2005
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity.- Problems and Results on Geometric Patterns.- Data Depth and Maximum Feasible Subsystems.- The Maximum Independent Set Problem and Augmenting Graphs.- Interior Point and Semidefinite Approaches in Combinatorial Optimization.- Balancing Mixed-Model Supply Chains.- Bilevel Programming: A Combinatorial Perspective.- Visualizing, Finding and Packing Dijoins.- Hypergraph Coloring by Bichromatic Exchanges.
Caracteristici
A current treatment of cutting-edge topics in Graph Theory and Combinatorial Optimization by leading researchers Includes heuristic advances and novel approaches to solving combinatorial optimization problems