1. Approximating the product knapsack problem

   • Ulrich Pferschy
   • Joachim Schauer
   • Clemens Thielen

   Original Paper Open access 04 June 2021 Pages: 2529 - 2540

   

2. Primal-dual incremental gradient method for nonsmooth and convex optimization problems

   • Afrooz Jalilzadeh

   Original Paper 20 May 2021 Pages: 2541 - 2554

   

3. Decentralized scheduling with precedence constraints

   • Hongtan Sun
   • Thomas C. Sharkey

   Original Paper 28 May 2021 Pages: 2555 - 2575

   

4. The single train shortest route problem in a railyard

   • Mina Aliakbari
   • Joseph Geunes
   • Kelly M. Sullivan

   Original Paper 04 June 2021 Pages: 2577 - 2595

   

5. Complexity of near-optimal robust versions of multilevel optimization problems

   • Mathieu Besançon
   • Miguel F. Anjos
   • Luce Brotcorne

   Original Paper Open access 29 June 2021 Pages: 2597 - 2610

   

6. Linear and conic reformulations for the maximum capture location problem under multinomial logit choice

   • F. Tevhide Altekin
   • Abdullah Dasci
   • Mumtaz Karatas

   Original Paper 20 January 2021 Pages: 2611 - 2637

   

7. Relating \(\ell _p\) regularization and reweighted \(\ell _1\) regularization

   • Hao Wang
   • Hao Zeng
   • Qiong Wu

   Original Paper 29 January 2021 Pages: 2639 - 2660

   

8. Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance

   • Qiao Zhang
   • Xiucui Guan
   • Panos M. Pardalos

   Original Paper 06 January 2021 Pages: 2661 - 2680

   

9. Optimization on fractal sets

   • Nizar Riane
   • Claire David

   Original Paper 04 January 2021 Pages: 2681 - 2700

   

10. Bounds of the solution set of the tensor complementarity problem

    • Yang Xu
    • Zheng-Hai Huang

    Original Paper 12 January 2021 Pages: 2701 - 2718

    

11. On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization

    • Goran Banjac
    • John Lygeros

    Original Paper Open access 04 February 2021 Pages: 2719 - 2732

12. On quantitative stability in infinite-dimensional optimization under uncertainty

    • M. Hoffhues
    • W. Römisch
    • T. M. Surowiec

    Original Paper Open access 28 February 2021 Pages: 2733 - 2756

    

13. A note on convex relaxations for the inverse eigenvalue problem

    • Utkan Candogan
    • Yong Sheng Soh
    • Venkat Chandrasekeran

    Original Paper 15 February 2021 Pages: 2757 - 2772

    

14. The quasidifferential descent method in a control problem with nonsmooth objective functional

    • A. V. Fominyh

    Original Paper 05 February 2021 Pages: 2773 - 2792

    

15. Shortest path network problems with stochastic arc weights

    • Jeremy D. Jordan
    • Stan Uryasev

    Original Paper 20 April 2021 Pages: 2793 - 2812

    

16. A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations

    • Maurizio Bruglieri
    • Simona Mancini
    • Ornella Pisacane

    Original Paper Open access 01 March 2021 Pages: 2813 - 2829

    

17. On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression

    • Shummin Nakayama
    • Jun-ya Gotoh

    Original Paper 03 March 2021 Pages: 2831 - 2860

    

18. Douglas–Rachford splitting algorithm for solving state-dependent maximal monotone inclusions

    • S. Adly
    • B. K. Le

    Original Paper 01 March 2021 Pages: 2861 - 2878

    

19. t-Linearization for the maximum diversity problem

    • Pablo Soares
    • Manoel Campêlo

    Review Article 09 March 2021 Pages: 2879 - 2895

    

20. Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 2021

    • Yaroslav D. Sergeyev

    Review Article Open access 14 July 2021 Pages: 2897 - 2899