1. Implicit solution function of P₀ and Z matrix linear complementarity constraints

   • Xiaojun Chen
   • Shuhuang Xiang

   Full Length Paper 28 May 2009 Pages: 1 - 18

2. On the exact separation of mixed integer knapsack cuts

   • Ricardo Fukasawa
   • Marcos Goycoolea

   Full Length Paper 06 June 2009 Pages: 19 - 41

3. Recognizing conic TDI systems is hard

   • Júlia Pap

   Full Length Paper 24 June 2009 Pages: 43 - 48

4. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints

   • Juan Pablo Vielma
   • George L. Nemhauser

   Full Length Paper 02 July 2009 Pages: 49 - 72

5. An interior-point piecewise linear penalty method for nonlinear programming

   • Lifeng Chen
   • Donald Goldfarb

   Full Length Paper 14 July 2009 Pages: 73 - 122

6. Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

   • Luis Gouveia
   • Luidi Simonetti
   • Eduardo Uchoa

   Full Length Paper 22 July 2009 Pages: 123 - 148

7. Maximizing a class of submodular utility functions

   • Shabbir Ahmed
   • Alper Atamtürk

   Full Length Paper Open access 08 August 2009 Pages: 149 - 169

8. A large class of facets for the K-median polytope

   • Wenhui Zhao
   • Marc E. Posner

   Full Length Paper 08 August 2009 Pages: 171 - 203

9. On the separation of disjunctive cuts

   • Matteo Fischetti
   • Andrea Lodi
   • Andrea Tramontani

   Full Length Paper 15 August 2009 Pages: 205 - 230

10. A robustification approach in unconstrained quadratic optimization

    • Martin K. Bernauer
    • Roland Griesse

    Full Length Paper 15 August 2009 Pages: 231 - 252

11. New results on Hermitian matrix rank-one decomposition

    • Wenbao Ai
    • Yongwei Huang
    • Shuzhong Zhang

    Full Length Paper 21 August 2009 Pages: 253 - 283

12. Combining and scaling descent and negative curvature directions

    • Catarina P. Avelino
    • Javier M. Moguerza
    • Francisco J. Prieto

    Full Length Paper 04 September 2009 Pages: 285 - 319

13. Fixed point and Bregman iterative methods for matrix rank minimization

    • Shiqian Ma
    • Donald Goldfarb
    • Lifeng Chen

    Full Length Paper 23 September 2009 Pages: 321 - 353

14. Budgeted matching and budgeted matroid intersection via the gasoline puzzle

    • André Berger
    • Vincenzo Bonifaci
    • Guido Schäfer

    Full Length Paper 13 October 2009 Pages: 355 - 372

15. On the structure of the solution set for the single facility location problem with average distances

    • Justo Puerto
    • Antonio M. Rodríguez-Chía

    Full Length Paper 13 October 2009 Pages: 373 - 401

16. Branching on general disjunctions

    • Miroslav Karamanov
    • Gérard Cornuéjols

    Full Length Paper 25 December 2009 Pages: 403 - 436

17. Approximation of linear fractional-multiplicative problems

    • Daniele Depetrini
    • Marco Locatelli

    Short Communication 30 October 2009 Pages: 437 - 443