- Rajni Dabas, Neelima Gupta. Uniform capacitated facility location with outliers/penalties. Discrete Optimization, 55:100878, 2025.
- Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi. Integer points in the degree-sequence polytope. Discrete Optimization, 55:100867, 2025.
- Luérbio Faria, Mauro Nigro, Diana Sasaki. A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs. Discrete Optimization, 55:100865, 2025.
- Cécile Rottner. Generalized min-up/min-down polytopes. Discrete Optimization, 55:100866, 2025.
- Gerold Jäger, Marcel Turkensteen. Computation of lower tolerances of combinatorial bottleneck problems. Discrete Optimization, 56:100887, 2025.
- Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange. Corrigendum to "A polyhedral study of lifted multicuts" [Discrete Optim. 47 (2023) 100757]. Discrete Optimization, 55:100876, 2025.
- Gökçe Çakmak, Ali Deniz, Sahin Koçak. Trimming of finite subsets of the Manhattan plane. Discrete Optimization, 56:100880, 2025.
- Hadi Charkhgard, Hanieh Rastegar Moghaddam, Ali Eshragh, Sasan Mahmoudinazlou, Kimia Keshanian. Solving hard bi-objective knapsack problems using deep reinforcement learning. Discrete Optimization, 55:100879, 2025.
- Yasemin Büyükçolak. Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs. Discrete Optimization, 55:100877, 2025.
- Imdat Kara, Gözde Önder Uzun. A remark on the formulation given in "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows". Discrete Optimization, 56:100888, 2025.