Titlebook: Integer Programming and Combinatorial Optimization; 10th International I Daniel Bienstock,George Nemhauser Conference proceedings 2004 Spri

dialect

978-3-540-22113-5Springer-Verlag Berlin Heidelberg 2004

侧面左右

Integer Programming and Combinatorial Optimization978-3-540-25960-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

不能逃避

0302-9743 Overview: Includes supplementary material: 978-3-540-22113-5978-3-540-25960-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

消音器

BOGUS

挑剔小责

Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic GamesThe problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.

不能根除

Three Min-Max Theorems Concerning Cyclic Orders of Strong DigraphsIn 1963, Tibor Gallai [9] asked whether every strongly connected directed graph . is spanned by . directed circuits, where . is the stability of .. We give a proof of this conjecture using a new structure for digraphs called .. Three min-max theorems for cyclic orders are derived.

Interlocking

Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational FunctionsThis paper presents three kinds of algebraic-analytic algorithms for solving integer and mixed integer programming problems. We report both theoretical and experimental results. We use the generating function techniques introduced by A. Barvinok.

憎恶

VICT

Daniel Bienstock,George NemhauserIncludes supplementary material: