| 1 | -- | 17 | Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks. The set partitioning problem in a quantum context |
| 19 | -- | 31 | Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks. Linear-size formulations for connected planar graph partitioning and political districting |
| 33 | -- | 55 | Vera Roshchina, Nadezda Sukhorukova, Julien Ugon. Uniqueness of solutions in multivariate Chebyshev approximation problems |
| 57 | -- | 71 | Manlio Gaudioso, Giampaolo Liuzzi, Stefano Lucidi. A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization |
| 73 | -- | 103 | Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev. Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems |
| 105 | -- | 133 | Feng Guo, Meijun Zhang. An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials |
| 135 | -- | 154 | Quentin Klopfenstein, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon, Samuel Vaiter. Local linear convergence of proximal coordinate descent algorithm |
| 195 | -- | 213 | Geovani Nunes Grapiglia. Worst-case evaluation complexity of a derivative-free quadratic regularization method |
| 215 | -- | 234 | Yifu Chen, Christos T. Maravelias, Xiaomin Zhang. Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms |
| 235 | -- | 255 | Pavel A. Borisovsky. A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem |
| 257 | -- | 277 | Kai Kopperschmidt, Ruslanas Stacevicius. Pooling adjacent violators under interval constraints |
| 279 | -- | 290 | Shiming Li, Wei Yu 0011, Zhaohui Liu 0001. A local search algorithm for the k-path partition problem |
| 307 | -- | 318 | Pengxiang Pan, Hongtao Zhu. Approximation algorithms for the restricted k-Chinese postman problems with penalties |
| 365 | -- | 375 | Abdennour Azerine, Mourad Boudhar, Djamal Rebaine. On the complexity of proportionate open shop and job shop problems |