1. Algorithms for the generalized independent set problem based on a quadratic optimization approach

   • Seyedmohammadhossein Hosseinian
   • Sergiy Butenko

   Original Paper 15 March 2019 Pages: 1211 - 1222

   

2. Higher-moment buffered probability

   • D. P. Kouri

   Original Paper 22 February 2019 Pages: 1223 - 1237

   

3. An active-set strategy to solve Markov decision processes with good-deal risk measure

   • Shu Tu
   • Boris Defourny

   Original Paper 25 February 2019 Pages: 1239 - 1257

   

4. Enhanced basic procedures for the projection and rescaling algorithm

   • David Huckleberry Gutman

   Original paper 24 January 2019 Pages: 1259 - 1267

   

5. On global minimizers of quadratic functions with cubic regularization

   • Andrea Cristofari
   • Tayebeh Dehghan Niri
   • Stefano Lucidi

   Original Paper 23 August 2018 Pages: 1269 - 1283

   

6. Properties of subgradient projection iteration when applying to linear imaging system

   • Caifang Wang

   Original paper 30 August 2018 Pages: 1285 - 1297

   

7. A new lifting theorem for vertex packing

   • Alfredo Marín
   • Mercedes Pelegrín

   Original Paper 18 August 2018 Pages: 1299 - 1312

   

8. On upper bounding Shannon capacity of graph through generalized conic programming

   • Yingjie Bi
   • Ao Tang

   Original Paper 24 May 2019 Pages: 1313 - 1323

9. Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies

   • Federico Piazzon
   • Marco Vianello

   Original Paper 01 January 2019 Pages: 1325 - 1343

   

10. A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

    • Mohammed Lalou
    • Hamamache Kheddouci

    Original Paper 14 December 2018 Pages: 1345 - 1364

    

11. Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems

    • N. S. Fazzio
    • M. L. Schuverdt

    Original Paper 16 November 2018 Pages: 1365 - 1379

12. Positive bases with maximal cosine measure

    • Geir Nævdal

    Original Paper Open access 05 October 2018 Pages: 1381 - 1388

13. Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions

    • Ziran Yin
    • Liwei Zhang

    Original Paper 09 November 2018 Pages: 1389 - 1402

14. Approximating two-stage chance-constrained programs with classical probability bounds

    • Bismark Singh
    • Jean-Paul Watson

    Original Paper 16 March 2019 Pages: 1403 - 1416

    

15. Representative scenario construction and preprocessing for robust combinatorial optimization problems

    • Marc Goerigk
    • Martin Hughes

    Original Paper 29 October 2018 Pages: 1417 - 1431

    

16. Dynamic improvements of static surrogates in direct search optimization

    • Charles Audet
    • Julien Côté-Massicotte

    Short Communication 09 July 2019 Pages: 1433 - 1447