1. Closing the gap in linear bilevel optimization: a new valid primal-dual inequality

   • Thomas Kleinert
   • Martine Labbé
   • Martin Schmidt

   Short Communication Open access 11 November 2020 Pages: 1027 - 1040

   

2. Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results

   • Viet Hung Nguyen
   • Michel Minoux

   Original Paper 20 November 2020 Pages: 1041 - 1060

   

3. Inverse integer optimization with multiple observations

   • Mahsa Moghaddass
   • Daria Terekhov

   Original Paper 23 March 2021 Pages: 1061 - 1079

   

4. A resiliency analysis of information distribution policies over mobile ad hoc networks

   • Ningji Wei
   • Jose L. Walteros
   • Héctor J. Ortiz-Peña

   Original Paper 25 March 2021 Pages: 1081 - 1103

   

5. An approximation algorithm for the submodular multicut problem in trees with linear penalties

   • Chenfei Hou
   • Suogang Gao
   • Bo Hou

   Original Paper 14 November 2020 Pages: 1105 - 1112

6. Vector network equilibrium problems with uncertain demands and capacity constraints of arcs

   • Hongzhi Wei
   • Chunrong Chen
   • Baowei Wu

   Original Paper 12 June 2020 Pages: 1113 - 1131

   

7. A loopless algorithm for generating (k, m)-ary trees in Gray code order

   • Yu-Hsuan Chang
   • Ro-Yu Wu
   • Jou-Ming Chang

   Original Paper 27 June 2020 Pages: 1133 - 1154

   

8. A best possible online algorithm for parallel batch scheduling with delivery times and limited restart

   • Hailing Liu
   • Xiwen Lu
   • Wenjie Li

   Original Paper 13 July 2020 Pages: 1155 - 1173

   

9. Strong Karush–Kuhn–Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials

   • Tran Van Su
   • Nguyen Duc Hien

   Original Paper 21 July 2020 Pages: 1175 - 1194

   

10. On using cardinality constrained uncertainty for objective coefficients in robust optimization

    • Jaeyoong Lim
    • Sungsoo Park

    Original Paper 11 August 2020 Pages: 1195 - 1214

    

11. Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure

    • El-Houcine Bergou
    • Youssef Diouane
    • Vyacheslav Kungurtsev

    Original Paper 23 July 2020 Pages: 1215 - 1227

    

12. Online algorithms for the mixed ring loading problem with two nodes

    • Li Guan
    • Weidong Li
    • Man Xiao

    Original Paper 14 August 2020 Pages: 1229 - 1239

    

13. Vector conjugation and subdifferential of vector topical function in complete lattice

    • C. L. Yao
    • J. W. Chen

    Original Paper 28 August 2020 Pages: 1241 - 1261

14. On the convergence of algorithms with Tikhonov regularization terms

    • Bruno Dinis
    • Pedro Pinto

    Original Paper 28 August 2020 Pages: 1263 - 1276

    

15. A note on partial calmness for bilevel optimization problems with linearly structured lower level

    • Patrick Mehlitz
    • Leonid I. Minchenko
    • Alain B. Zemkoho

    Original Paper 16 September 2020 Pages: 1277 - 1291

    

16. Improved lower bound on the dimension of the EU council’s voting rules

    • Stefan Kober
    • Stefan Weltge

    Original Paper Open access 05 September 2020 Pages: 1293 - 1302

17. Improved analysis of spectral algorithm for clustering

    • Tomohiko Mizutani

    Manuscript 08 September 2020 Pages: 1303 - 1325

18. The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects

    • Settar Muştu
    • Tamer Eren

    Original Paper 21 September 2020 Pages: 1327 - 1343

    

19. Iterated local search for the generalized independent set problem

    • Bruno Nogueira
    • Rian G. S. Pinheiro
    • Eduardo Tavares

    Original Paper 03 October 2020 Pages: 1345 - 1369

    

20. A characterization of weighted simple games based on pseudoweightings

    • Josep Freixas

    Original Paper 14 September 2020 Pages: 1371 - 1383

21. Personnel scheduling during Covid-19 pandemic

    • Giorgio Zucchi
    • Manuel Iori
    • Anand Subramanian

    Original Paper 04 October 2020 Pages: 1385 - 1396

    

22. FPTAS for barrier covering problem with equal touching circles in 2D

    • Adil Erzin
    • Natalya Lagutkina

    Original Paper 10 October 2020 Pages: 1397 - 1406

    

23. A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order

    • André R. S. Amaral

    Original Paper 18 November 2020 Pages: 1407 - 1423

    

24. An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints

    • S. Ansary Karbasy
    • A. Hamdi
    • A. Taati

    Original Paper 06 January 2021 Pages: 1425 - 1446

    

25. On minimization of a quadratic function with one negative eigenvalue

    • Ilya Minarchenko
    • Oleg Khamisov

    Original Paper 12 October 2020 Pages: 1447 - 1455

26. Strong convergence theorems for inertial Tseng’s extragradient method for solving variational inequality problems and fixed point problems

    • Gang Cai
    • Qiao-Li Dong
    • Yu Peng

    Original Paper 14 October 2020 Pages: 1457 - 1474

    

27. An approximation algorithm for the k-generalized Steiner forest problem

    • Jiawen Gao
    • Suogang Gao
    • Bo Hou

    Original Paper 24 March 2021 Pages: 1475 - 1483

    

28. A note on semi-infinite program bounding methods

    • Stuart M. Harwood
    • Dimitri J. Papageorgiou
    • Francisco Trespalacios

    Short Communication 11 September 2020 Pages: 1485 - 1490

    

29. Primal-dual subgradient method for constrained convex optimization problems

    • Michael R. Metel
    • Akiko Takeda

    Short Communication 05 April 2021 Pages: 1491 - 1504

    

30. Correction to: Fairness criteria for allocating scarce resources

    • Bismark Singh

    Correction 26 October 2020 Pages: 1505 - 1505