| 1 | -- | 6 | Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. Constrained submodular maximization via greedy local search |
| 7 | -- | 11 | Cong Chen, Yinfeng Xu. Selfish load balancing for jobs with favorite machines |
| 12 | -- | 15 | Matteo Brunelli, Jafar Rezaei 0001. A multiplicative best-worst method for multi-criteria decision making |
| 16 | -- | 20 | Ravi Kumar Kolla, Prashanth L. A., Sanjay P. Bhat, Krishna P. Jagannathan. Concentration bounds for empirical conditional value-at-risk: The unbounded case |
| 21 | -- | 24 | André B. Chassein, Marc Goerigk. On the complexity of robust geometric programming with polyhedral uncertainty |
| 25 | -- | 29 | José R. Correa, Patricio Foncea, Dana Pizarro, Victor Verdugo. From pricing to prophets, and back! |
| 30 | -- | 35 | Rui Chen, Hai Jiang 0002. Capacitated assortment and price optimization under the multilevel nested logit model |
| 36 | -- | 40 | Qingwen Hu. Bullwhip effect in a supply chain model with multiple delivery delays |
| 41 | -- | 46 | Hongjun Wei, Jinjiang Yuan. Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time |
| 47 | -- | 51 | Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif. Extension complexity of the correlation polytope |
| 52 | -- | 58 | Karthick Gopalswamy, Yahya Fathi, Reha Uzsoy. Valid inequalities for concave piecewise linear regression |
| 59 | -- | 65 | Ali Mohammad Nezhad, Tamás Terlaky. A rounding procedure for semidefinite optimization |
| 66 | -- | 69 | Yusuke Kobayashi, Ryo Sako. Two disjoint shortest paths problem with non-negative edge length |
| 70 | -- | 75 | Marinus Gottschau, Marcus Kaiser, Clara Waldmann. The undirected two disjoint shortest paths problem |