1. A flow model based on polylinking system

   • Michel X. Goemans
   • Satoru Iwata
   • Rico Zenklusen

   Full Length Paper 05 March 2011 Pages: 1 - 23

2. Cone superadditivity of discrete convex functions

   • Yusuke Kobayashi
   • Kazuo Murota
   • Robert Weismantel

   Full Length Paper 20 March 2011 Pages: 25 - 44

3. Mixing polyhedra with two non divisible coefficients

   • Agostinho Agra
   • Miguel Constantino

   Full Length Paper 26 March 2011 Pages: 45 - 87

4. A primal–dual interior point method for nonlinear semidefinite programming

   • Hiroshi Yamashita
   • Hiroshi Yabe
   • Kouhei Harada

   Full Length Paper 29 March 2011 Pages: 89 - 121

5. On linear and semidefinite programming relaxations for hypergraph matching

   • Yuk Hei Chan
   • Lap Chi Lau

   Full Length Paper 20 April 2011 Pages: 123 - 148

6. An augmented Lagrangian approach for sparse principal component analysis

   • Zhaosong Lu
   • Yong Zhang

   Full Length Paper 27 April 2011 Pages: 149 - 193

7. An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications

   • Zdeněk Dostál
   • Tomáš Kozubek

   Full Length Paper 04 May 2011 Pages: 195 - 220

8. Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra

   • Sanjeeb Dash
   • Santanu S. Dey
   • Oktay Günlük

   Full Length Paper 05 May 2011 Pages: 221 - 254

9. A relaxed constant positive linear dependence constraint qualification and applications

   • Roberto Andreani
   • Gabriel Haeser
   • Paulo J. S. Silva

   Full Length Paper 06 May 2011 Pages: 255 - 273

10. A convex polynomial that is not sos-convex

    • Amir Ali Ahmadi
    • Pablo A. Parrilo

    Full Length Paper 02 June 2011 Pages: 275 - 292

11. Optimality functions in stochastic programming

    • J. O. Royset

    Full Length Paper 11 June 2011 Pages: 293 - 321

12. Vectors in a box

    • Kevin Buchin
    • Jiří Matoušek
    • Dömötör Pálvölgyi

    Full Length Paper Open access 18 June 2011 Pages: 323 - 335

13. Structural and algorithmic properties for parametric minimum cuts

    • Frieda Granot
    • S. Thomas McCormick
    • Fabio Tardella

    Full Length Paper 26 June 2011 Pages: 337 - 367

14. An effective branch-and-bound algorithm for convex quadratic integer programming

    • Christoph Buchheim
    • Alberto Caprara
    • Andrea Lodi

    Full Length Paper 15 July 2011 Pages: 369 - 395

15. On convergence in mixed integer programming

    • Alberto Del Pia
    • Robert Weismantel

    Full Length Paper 19 July 2011 Pages: 397 - 412

16. A limited memory steepest descent method

    • Roger Fletcher

    Full Length Paper 21 July 2011 Pages: 413 - 436

17. Robust resource allocations in temporal networks

    • Wolfram Wiesemann
    • Daniel Kuhn
    • Berç Rustem

    Full Length Paper 24 July 2011 Pages: 437 - 471

18. Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems

    • Felipe Álvarez
    • Jérôme Bolte
    • Francisco J. Silva

    Full Length Paper 29 July 2011 Pages: 473 - 507

19. A hard integer program made easy by lexicography

    • Egon Balas
    • Matteo Fischetti
    • Arrigo Zanette

    Short Communication 09 April 2011 Pages: 509 - 514