A memetic procedure for global multi-objective optimization Matteo LapucciPierluigi MansuetoFabio Schoen Full Length Paper Open access 22 November 2022 Pages: 227 - 267
A branch and bound algorithm for robust binary optimization with budget uncertainty Christina BüsingTimo GersingArie M. C. A. Koster Full Length Paper Open access 23 January 2023 Pages: 269 - 326
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization Raghu BollapragadaStefan M. Wild Full Length Paper 14 March 2023 Pages: 327 - 364
Feasibility Jump: an LP-free Lagrangian MIP heuristic Bjørnar LutebergetGiorgio Sartor Full Length Paper Open access 14 March 2023 Pages: 365 - 388
On the generation of metric TSP instances with a large integrality gap by branch-and-cut Eleonora VercesiStefano GualandiLuca Maria Gambardella Full Length Paper Open access 27 March 2023 Pages: 389 - 416