Sharpest Cut / Nejlevnější knihy
Sharpest Cut

Kód: 02050152

Sharpest Cut

Autor Martin Grötschel

The Sharpest Cut is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection pre ... celý popis

3557


Skladem u dodavatele
Odesíláme za 14-20 dnů
Přidat mezi přání

Mohlo by se vám také líbit

Dárkový poukaz: Radost zaručena

Objednat dárkový poukazVíce informací

Více informací o knize Sharpest Cut

Nákupem získáte 356 bodů

Anotace knihy

The Sharpest Cut is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection presents recent results in these areas that are closely connected to Padberg's research. His deep commitment to the geometrical approach to combinatorial optimization can be felt throughout this volume; his search for increasingly better and computationally efficient cutting planes gave rise to its title. The peer-reviewed papers contained here are based on invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday. Grouped by topic (packing, stable sets, and perfect graphs; polyhedral combinatorics; general polytopes; semidefinite programming; computation), many of the papers set out to solve challenges set forth in Padberg's work. The book also shows how Padberg's ideas on cutting planes have influenced modern commercial optimization software.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Optimization

3557

Oblíbené z jiného soudku



Osobní odběr Praha, Brno a 48536 dalších

Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies


Můj účet: Přihlásit se
Všechny knihy světa na jednom místě. Navíc za skvělé ceny.

Nákupní košík ( prázdný )

Vyzvednutí v Balikovně a PPL
boxech
zdarma nad 1 499 Kč.

Nacházíte se: