Foreword: Special issue on IPCO 2005 Michael JüngerVolker Kaibel PREFACE 01 December 2006 Pages: 1 - 2
Optimizing over the first Chvátal closure Matteo FischettiAndrea Lodi FULL LENGTH PAPER 15 December 2006 Pages: 3 - 20
Smoothed analysis of integer programming Heiko RöglinBerthold Vöcking FULL LENGTH PAPER 05 January 2007 Pages: 21 - 56
Combinatorial algorithms for matchings, even factors and square-free 2-factors Gyula Pap FULL LENGTH PAPER 12 December 2006 Pages: 57 - 69
Approximate min–max relations for odd cycles in planar graphs Samuel FioriniNadia HardyAdrian Vetta FULL LENGTH PAPER 15 December 2006 Pages: 71 - 91
On approximating complex quadratic optimization problems via semidefinite programming relaxations Anthony Man-Cho SoJiawei ZhangYinyu Ye FULL LENGTH PAPER 13 December 2006 Pages: 93 - 110
On the L∞-norm of extreme points for crossing supermodular directed network LPs Harold N. Gabow FULL LENGTH PAPER 15 December 2006 Pages: 111 - 144
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials Nebojša GvozdenovićMonique Laurent FULL LENGTH PAPER 15 December 2006 Pages: 145 - 173
On the graphical relaxation of the symmetric traveling salesman polytope Marcus OswaldGerhard ReineltDirk Oliver Theis FULL LENGTH PAPER 15 December 2006 Pages: 175 - 193
Power optimization for connectivity problems Mohammad T. HajiaghayiGuy KortsarzZeev Nutov FULL LENGTH PAPER 14 December 2006 Pages: 195 - 208
Machine scheduling with resource dependent processing times Alexander GrigorievMaxim SviridenkoMarc Uetz FULL LENGTH PAPER 12 December 2006 Pages: 209 - 228
Computing the inertia from sign patterns Naonori KakimuraSatoru Iwata FULL LENGTH PAPER 12 December 2006 Pages: 229 - 244