Mathematical Programming, Volume 110

Volume 110, Number 1, June 2007

• Michael Jünger, Volker Kaibel:
  Foreword: Special issue on IPCO 2005. 1-2
  Electronic Edition (link) BibTeX
• Matteo Fischetti, Andrea Lodi:
  Optimizing over the first Chvátal closure. 3-20
  Electronic Edition (link) BibTeX
• Heiko Röglin, Berthold Vöcking:
  Smoothed analysis of integer programming. 21-56
  Electronic Edition (link) BibTeX
• Gyula Pap:
  Combinatorial algorithms for matchings, even factors and square-free 2-factors. 57-69
  Electronic Edition (link) BibTeX
• Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
  Approximate min-max relations for odd cycles in planar graphs. 71-91
  Electronic Edition (link) BibTeX
• Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
  On approximating complex quadratic optimization problems via semidefinite programming relaxations. 93-110
  Electronic Edition (link) BibTeX
• Harold N. Gabow:
  On the L_infinity-norm of extreme points for crossing supermodular directed network LPs. 111-144
  Electronic Edition (link) BibTeX
• Nebojsa Gvozdenovic, Monique Laurent:
  Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. 145-173
  Electronic Edition (link) BibTeX
• Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
  On the graphical relaxation of the symmetric traveling salesman polytope. 175-193
  Electronic Edition (link) BibTeX
• Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
  Power optimization for connectivity problems. 195-208
  Electronic Edition (link) BibTeX
• Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
  Machine scheduling with resource dependent processing times. 209-228
  Electronic Edition (link) BibTeX
• Naonori Kakimura, Satoru Iwata:
  Computing the inertia from sign patterns. 229-244
  Electronic Edition (link) BibTeX

Volume 110, Number 2, July 2007

• Yurii Nesterov:
  Smoothing Technique and its Applications in Semidefinite Optimization. 245-259
  Electronic Edition (link) BibTeX
• Sven de Vries, Marc E. Posner, Rakesh V. Vohra:
  Polyhedral Properties of the K -median Problem on a Tree. 261-285
  Electronic Edition (link) BibTeX
• Dimitri P. Bertsekas, Paul Tseng:
  Set Intersection Theorems and Existence of Optimal Solutions. 287-314
  Electronic Edition (link) BibTeX
• Masakazu Kojima, Masakazu Muramatsu:
  An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. 315-336
  Electronic Edition (link) BibTeX
• Mihai Anitescu, Paul Tseng, Stephen J. Wright:
  Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. 337-371
  Electronic Edition (link) BibTeX
• Andrea Grosso, Marco Locatelli, Fabio Schoen:
  A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. 373-404
  Electronic Edition (link) BibTeX
• Kung Fu Ng, Lu Lin Tan:
  Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems. 405-429
  Electronic Edition (link) BibTeX
• Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
  Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. 431-441
  Electronic Edition (link) BibTeX
• Florian A. Potra:
  A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity. 443-444
  Electronic Edition (link) BibTeX

Volume 110, Number 3, September 2007

• Jagat Patel, John W. Chinneck:
  Active-constraint variable ordering for faster feasibility of mixed integer linear programs. 445-474
  Electronic Edition (link) BibTeX
• Chee-Khian Sim, Gongyun Zhao:
  Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. 475-499
  Electronic Edition (link) BibTeX
• Sylvia C. Boyd, Sally Cockburn, Danielle Vella:
  On the domino-parity inequalities for the STSP. 501-519
  Electronic Edition (link) BibTeX
• V. Jeyakumar, Alex M. Rubinov, Z. Y. Wu:
  Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. 521-541
  Electronic Edition (link) BibTeX
• Yunpeng Pan, Leyuan Shi:
  On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. 543-559
  Electronic Edition (link) BibTeX
• Todd S. Munson:
  Mesh shape-quality optimization using the inverse mean-ratio metric. 561-590
  Electronic Edition (link) BibTeX
• George Karakostas, Anastasios Viglas:
  Equilibria for networks with malicious users. 591-613
  Electronic Edition (link) BibTeX
• Adam B. Levy:
  Constraint incorporation in optimization. 615-639
  Electronic Edition (link) BibTeX
• Walter Kern, Gerhard J. Woeginger:
  Quadratic programming and combinatorial minimum weight product problems. 641-649
  Electronic Edition (link) BibTeX