- Santanu S. Dey, Burak Kocuk, Nicole Redder. Node-based valid inequalities for the optimal transmission switching problem. Discrete Optimization, 43:100683, 2022.
- Jun Wu, Yongxi Cheng, Ding-Zhu Du. An improved zig zag approach for competitive group testing. Discrete Optimization, 43:100687, 2022.
- Steffen Borgwardt, Stephan Patterson. A column generation approach to the discrete barycenter problem. Discrete Optimization, 43:100674, 2022.
- Olivera Stancic, Zorica Stanimirovic, Raca Todosijevic, Stefan Miskovic. Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem. Discrete Optimization, 43:100672, 2022.
- Daniel Berend, Shahar Golan, Yochai Twitto. GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat. Discrete Optimization, 43:100685, 2022.
- Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda. Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. Discrete Optimization, 41:100646, 2021.
- Leah Epstein. On bin packing with clustering and bin packing with delays. Discrete Optimization, 41:100647, 2021.
- Jason M. Altschuler, Enric Boix-Adserà. Hardness results for Multimarginal Optimal Transport problems. Discrete Optimization, 42:100669, 2021.
- Pol Llagostera, Nacho López, Carles Comas. Network reliability in hamiltonian graphs. Discrete Optimization, 41:100645, 2021.
- Shinya Fujita 0001, Boram Park. The optimal proper connection number of a graph with given independence number. Discrete Optimization, 41:100660, 2021.