Journal: Math. Program. Comput.

Volume 15, Issue 4

591 -- 619Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, Jean-Paul Watson, David L. Woodruff. A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
621 -- 650Nathaniel Bowman, Michael T. Heath. Computing minimum-volume enclosing ellipsoids
651 -- 701Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron. A hierarchy of spectral relaxations for polynomial optimization
703 -- 731Ksenia Bestuzheva, Ambros M. Gleixner, Stefan Vigerske. A computational study of perspective cuts
733 -- 782Yasmine Beck, Ivana Ljubic, Martin Schmidt 0003. Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem

Volume 15, Issue 3

417 -- 444Christian Kanzow, Daniel Steck. Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
445 -- 470Daniel Rehfeldt, Thorsten Koch, Yuji Shinano. Faster exact solution of sparse MaxCut and QUBO problems
471 -- 508Yangyang Xu, Yibo Xu, Yonggui Yan, Colin Sutcher-Shepard, Leopold Grinberg, Jie Chen 0007. Parallel and distributed asynchronous adaptive stochastic gradient methods
509 -- 548Stephen J. Maher, Elina Rönnberg. Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
549 -- 580Gennadiy Averkov, Christopher Hojny, Matthias Schymura. Efficient MIP techniques for computing the relaxation complexity
581 -- 589Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, Juan Pablo Vielma. JuMP 1.0: recent improvements to a modeling language for mathematical optimization

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

Volume 15, Issue 1

1 -- 51Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs. Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
53 -- 101Chris Coey, Lea Kapelevich, Juan Pablo Vielma. Performance enhancements for a generic conic interior point algorithm
103 -- 151Demetrios V. Papazaharias, Jose L. Walteros. Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
153 -- 194Saverio Basso, Alberto Ceselli. A data driven Dantzig-Wolfe decomposition framework
195 -- 225Zhensheng Yu, Xuyu Chen, Xudong Li. A dynamic programming approach for generalized nearly isotonic optimization