1. The set partitioning problem in a quantum context

   • Rafael Cacao
   • Lucas R. C. T. Cortez
   • Illya V. Hicks

   Original Paper 23 June 2023 Pages: 1 - 17

   

2. Linear-size formulations for connected planar graph partitioning and political districting

   • Jack Zhang
   • Hamidreza Validi
   • Illya V. Hicks

   Original Paper 05 October 2023 Pages: 19 - 31

   

3. Uniqueness of solutions in multivariate Chebyshev approximation problems

   • Vera Roshchina
   • Nadezda Sukhorukova
   • Julien Ugon

   Original Paper Open access 04 August 2023 Pages: 33 - 55

   

4. A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization

   • Manlio Gaudioso
   • Giampaolo Liuzzi
   • Stefano Lucidi

   Original Paper Open access 13 July 2023 Pages: 57 - 71

   

5. Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems

   • D. V. Gribanov
   • I. A. Shumilov
   • D. S. Malyshev

   Original Paper 27 May 2023 Pages: 73 - 103

6. An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials

   • Feng Guo
   • Meijun Zhang

   Original Paper 27 January 2023 Pages: 105 - 133

   

7. Local linear convergence of proximal coordinate descent algorithm

   • Quentin Klopfenstein
   • Quentin Bertrand
   • Samuel Vaiter

   Original Paper 22 March 2023 Pages: 135 - 154

   

8. The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis

   • Feng Xue

   Original Paper 17 February 2023 Pages: 155 - 194

9. Worst-case evaluation complexity of a derivative-free quadratic regularization method

   • Geovani Nunes Grapiglia

   Original Paper 09 February 2023 Pages: 195 - 213

   

10. Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms

    • Yifu Chen
    • Christos T. Maravelias
    • Xiaomin Zhang

    Original Paper 26 February 2023 Pages: 215 - 234

    

11. A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem

    • Pavel Borisovsky

    Original Paper 15 February 2023 Pages: 235 - 255

    

12. Pooling adjacent violators under interval constraints

    • Kai Kopperschmidt
    • Ruslanas Stacevičius

    Original Paper 26 February 2023 Pages: 257 - 277

    

13. A local search algorithm for the k-path partition problem

    • Shiming Li
    • Wei Yu
    • Zhaohui Liu

    Original Paper 27 February 2023 Pages: 279 - 290

    

14. k-sparse vector recovery via Truncated \(\ell _1-\ell _2\) local minimization

    • Shaohua Xie
    • Jia Li

    Original Paper 21 March 2023 Pages: 291 - 305

    

15. Approximation algorithms for the restricted k-Chinese postman problems with penalties

    • Pengxiang Pan
    • Hongtao Zhu

    Original Paper 13 March 2023 Pages: 307 - 318

    

16. A best possible online algorithm for minimizing the total completion time and the total soft penalty cost

    • Ran Ma
    • Juannian Xu
    • Yuzhong Zhang

    Original Paper 02 February 2023 Pages: 319 - 338

    

17. Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form

    • Mengxue Xia
    • Haohao Li
    • Daojun Xu

    Original Paper 25 April 2023 Pages: 339 - 364

18. On the complexity of proportionate open shop and job shop problems

    • Abdennour Azerine
    • Mourad Boudhar
    • Djamal Rebaine

    Short Communication 05 April 2023 Pages: 365 - 375