1. Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone

   • Frank Permenter
   • Pablo Parrilo

   Full Length Paper 28 June 2017 Pages: 1 - 54

   

2. Robust flows over time: models and complexity results

   • Corinna Gottschalk
   • Arie M. C. A. Koster
   • Andreas Wierz

   Full Length Paper 20 June 2017 Pages: 55 - 85

   

3. Polynomial combinatorial algorithms for skew-bisubmodular function minimization

   • Satoru Fujishige
   • Shin-ichi Tanigawa

   Full Length Paper 22 June 2017 Pages: 87 - 114

   

4. Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations

   • Peyman Mohajerin Esfahani
   • Daniel Kuhn

   Full Length Paper Open access 07 July 2017 Pages: 115 - 166

   

5. An optimal randomized incremental gradient method

   • Guanghui Lan
   • Yi Zhou

   Full Length Paper 28 June 2017 Pages: 167 - 215

   

6. Robust sample average approximation

   • Dimitris Bertsimas
   • Vishal Gupta
   • Nathan Kallus

   Full Length Paper 29 June 2017 Pages: 217 - 282

   

7. The diameters of network-flow polytopes satisfy the Hirsch conjecture

   • S. Borgwardt
   • J. A. De Loera
   • E. Finhold

   Full Length Paper 11 July 2017 Pages: 283 - 309

   

8. Complexity bounds for primal-dual methods minimizing the model of objective function

   • Yu. Nesterov

   Full Length Paper 21 August 2017 Pages: 311 - 330

9. Aggregation-based cutting-planes for packing and covering integer programs

   • Merve Bodur
   • Alberto Del Pia
   • Sebastian Pokutta

   Full Length Paper 18 September 2017 Pages: 331 - 359

   

10. Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems

    • Jane J. Ye
    • Jinchuan Zhou

    Full Length Paper 09 September 2017 Pages: 361 - 395

11. Completely positive semidefinite rank

    • Anupam Prakash
    • Jamie Sikora
    • Zhaohui Wei

    Full Length Paper 05 October 2017 Pages: 397 - 431

12. New algorithms for maximum disjoint paths based on tree-likeness

    • Krzysztof Fleszar
    • Matthias Mnich
    • Joachim Spoerhase

    Full Length Paper Open access 14 November 2017 Pages: 433 - 461

    

13. On error bound moduli for locally Lipschitz and regular functions

    • M. H. Li
    • K. W. Meng
    • X. Q. Yang

    Full Length Paper 25 October 2017 Pages: 463 - 487

14. On max-k-sums

    • Michael J. Todd

    Full Length Paper 26 October 2017 Pages: 489 - 517

15. Polyhedral results on the stable set problem in graphs containing even or odd pairs

    • Jonas T. Witt
    • Marco E. Lübbecke
    • Bruce Reed

    Short Communication 07 June 2017 Pages: 519 - 522