Integer Programming And Combinatorial Optimization

M. Fischetti, et al.0302-9743-3-5

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007.The 36 revised full papers presented were carefully reviewed and selected from over 120 submissions. Among the topics addressed are approximation algorithms, algorithmic game theory, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, as well as semidefinite programs.

---

Table of contents :
000……Page 1
001……Page 9
Concluding Remarks……Page 0
016……Page 24
030……Page 38
043……Page 51
053……Page 61
068……Page 76
074……Page 82
089……Page 97
104……Page 112
119……Page 127
130……Page 138
145……Page 153
158……Page 166
167……Page 175
182……Page 190
197……Page 205
210……Page 218
225……Page 233
Introduction……Page 248
The Base Polyhedron……Page 249
Distance Functions and Optimality Conditions……Page 250
Distance Functions and Extreme Vectors……Page 252
A Strongly Polynomial Algorithm for SFM……Page 253
The Auxiliary Matrix and How to Choose $γ$……Page 254
Proof of Correctness and Time Bound……Page 256
References……Page 259
252……Page 260
267……Page 275
280……Page 288
295……Page 303
310……Page 318
324……Page 332
337……Page 345
352……Page 360
367……Page 375
382……Page 390
397……Page 405
410……Page 418
424……Page 432
439……Page 447
454……Page 462
469……Page 477
484……Page 492
500……Page 507