//-->
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
Discrete optimization : a quantum revolution?
Creemers, Stefan, (2025)
An iterative algorithm for the max-min knapsack problem with multiple scenarios
Al-douri, Thekra, (2021)
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
Pitch, extension complexity, and covering problems
Bienstock, Daniel, (2021)
Quasi-popular matchings, optimality, and extended formulations
Faenza, Yuri, (2022)