External Links

    Journal: Math. Program. Comput.

    Volume 15, Issue 2

    227 -- 267Matteo Lapucci, Pierluigi Mansueto, Fabio Schoen. A memetic procedure for global multi-objective optimization
    269 -- 326Christina Büsing, Timo Gersing, Arie M. C. A. Koster. A branch and bound algorithm for robust binary optimization with budget uncertainty
    327 -- 364Raghu Bollapragada, Stefan M. Wild. Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
    365 -- 388Bjørnar Luteberget, Giorgio Sartor. Feasibility Jump: an LP-free Lagrangian MIP heuristic
    389 -- 416Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella. On the generation of metric TSP instances with a large integrality gap by branch-and-cut
    runs on