Mathematical Programming, Volume 113

Volume 113, Number 1, May 2008

• Antoine Deza, Eissa Nematollahi, Tamás Terlaky:
  How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. 1-14
  Electronic Edition (link) BibTeX
• Quentin Louveaux, Robert Weismantel:
  Polyhedral properties for the intersection of two knapsacks. 15-37
  Electronic Edition (link) BibTeX
• Fumei Lam, Alantha Newman:
  Traveling salesman path problems. 39-59
  Electronic Edition (link) BibTeX
• Daniel Kuhn:
  Aggregation and discretization in multistage stochastic programming. 61-94
  Electronic Edition (link) BibTeX
• José R. Rodríguez-Mancilla, William T. Ziemba:
  The duality of option investment strategies for hedge funds. 95-131
  Electronic Edition (link) BibTeX
• Vincent Acary, Bernard Brogliato, Daniel Goeleven:
  Higher order Moreau's sweeping process: mathematical formulation and numerical simulation. 133-217
  Electronic Edition (link) BibTeX

Volume 113, Number 2, June 2008

• Egon Balas, Anureet Saxena:
  Optimizing over the split closure. 219-240
  Electronic Edition (link) BibTeX
• Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:
  Projected Chvátal-Gomory cuts for mixed integer linear programs. 241-257
  Electronic Edition (link) BibTeX
• Samuel Burer, Dieter Vandenbussche:
  A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. 259-282
  Electronic Edition (link) BibTeX
• Dusan Bednarík, Karel Pastor:
  On second-order conditions in unconstrained optimization. 283-298
  Electronic Edition (link) BibTeX
• O. Briant, Claude Lemaréchal, Philippe Meurdesoif, S. Michel, N. Perrot, François Vanderbeck:
  Comparison of bundle and classical column generation. 299-344
  Electronic Edition (link) BibTeX
• Jong-Shi Pang, David E. Stewart:
  Differential variational inequalities. 345-424
  Electronic Edition (link) BibTeX