Articles

1. KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price

   • Ayşe N. Arslan
   • Jérémy Omer
   • Fulin Yan

   Full Length Paper 18 January 2024 Pages: 151 - 184

   

2. CP-Lib: Benchmark Instances of the Clique Partitioning Problem

   • Michael M. Sørensen
   • Adam N. Letchford

   Full Length Paper 03 November 2023 Pages: 93 - 111

   

3. Self-adaptive ADMM for semi-strongly convex problems

   • Tianyun Tang
   • Kim-Chuan Toh

   Full Length Paper 27 October 2023 Pages: 113 - 150

   

4. Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form

   • Mehdi Karimi
   • Levent Tunçel

   Full Length Paper 21 October 2023 Pages: 37 - 92

   

5. A computational study of perspective cuts

   • Ksenia Bestuzheva
   • Ambros Gleixner
   • Stefan Vigerske

   Full Length Paper Open access 21 August 2023 Pages: 703 - 731

   

6. Structure-aware methods for expensive derivative-free nonsmooth composite optimization

   • Jeffrey Larson
   • Matt Menickelly

   Full Length Paper 19 August 2023 Pages: 1 - 36

   

7. A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

   • Bernard Knueven
   • David Mildebrath
   • David L. Woodruff

   Full Length Paper 14 August 2023 Pages: 591 - 619

   

8. Exact methods for discrete \({\varGamma }\)-robust interdiction problems with an application to the bilevel knapsack problem

   • Yasmine Beck
   • Ivana Ljubić
   • Martin Schmidt

   Full Length Paper Open access 10 July 2023 Pages: 733 - 782

   

9. Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization

   • Christian Kanzow
   • Daniel Steck

   Full Length Paper Open access 10 June 2023 Pages: 417 - 444

   

10. JuMP 1.0: recent improvements to a modeling language for mathematical optimization

    • Miles Lubin
    • Oscar Dowson
    • Juan Pablo Vielma

    Short communication 02 June 2023 Pages: 581 - 589

    

11. A hierarchy of spectral relaxations for polynomial optimization

    • Ngoc Hoang Anh Mai
    • Jean-Bernard Lasserre
    • Victor Magron

    Full Length Paper 22 May 2023 Pages: 651 - 701

    

12. Computing minimum-volume enclosing ellipsoids

    • Nathaniel Bowman
    • Michael T. Heath

    Full Length Paper Open access 20 May 2023 Pages: 621 - 650

    

13. 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

    • Stephen J. Maher
    • Elina Rönnberg

    Full Length Paper Open access 25 April 2023 Pages: 509 - 548

    

14. Faster exact solution of sparse MaxCut and QUBO problems

    • Daniel Rehfeldt
    • Thorsten Koch
    • Yuji Shinano

    Full Length Paper Open access 15 April 2023 Pages: 445 - 470

    

15. Efficient MIP techniques for computing the relaxation complexity

    • Gennadiy Averkov
    • Christopher Hojny
    • Matthias Schymura

    Full Length Paper Open access 11 April 2023 Pages: 549 - 580

16. On the generation of metric TSP instances with a large integrality gap by branch-and-cut

    • Eleonora Vercesi
    • Stefano Gualandi
    • Luca Maria Gambardella

    Full Length Paper Open access 27 March 2023 Pages: 389 - 416

    

17. Parallel and distributed asynchronous adaptive stochastic gradient methods

    • Yangyang Xu
    • Yibo Xu
    • Jie Chen

    Full Length Paper 19 March 2023 Pages: 471 - 508

    

18. Feasibility Jump: an LP-free Lagrangian MIP heuristic

    • Bjørnar Luteberget
    • Giorgio Sartor

    Full Length Paper Open access 14 March 2023 Pages: 365 - 388

    

19. Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

    • Raghu Bollapragada
    • Stefan M. Wild

    Full Length Paper 14 March 2023 Pages: 327 - 364

    

20. A branch and bound algorithm for robust binary optimization with budget uncertainty

    • Christina Büsing
    • Timo Gersing
    • Arie M. C. A. Koster

    Full Length Paper Open access 23 January 2023 Pages: 269 - 326

    

21. Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds

    • Xueyu Shi
    • Oleg A. Prokopyev
    • Ted K. Ralphs

    Full Length Paper 08 December 2022 Pages: 1 - 51

    

22. A memetic procedure for global multi-objective optimization

    • Matteo Lapucci
    • Pierluigi Mansueto
    • Fabio Schoen

    Full Length Paper Open access 22 November 2022 Pages: 227 - 267

    

23. Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations

    • Demetrios V. Papazaharias
    • Jose L. Walteros

    Full Length Paper 07 November 2022 Pages: 103 - 151

    

24. A data driven Dantzig–Wolfe decomposition framework

    • Saverio Basso
    • Alberto Ceselli

    Full Length Paper Open access 02 November 2022 Pages: 153 - 194

    

25. A dynamic programming approach for generalized nearly isotonic optimization

    • Zhensheng Yu
    • Xuyu Chen
    • Xudong Li

    Full Length Paper 19 October 2022 Pages: 195 - 225

    

26. Performance enhancements for a generic conic interior point algorithm

    • Chris Coey
    • Lea Kapelevich
    • Juan Pablo Vielma

    Full Length Paper Open access 17 September 2022 Pages: 53 - 101

    

27. A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl

    • Jordan Jalving
    • Sungho Shin
    • Victor M. Zavala

    Full Length Paper 18 August 2022 Pages: 699 - 747

    

28. On technical debt in mathematical programming: An exploratory study

    • Melina Vidoni
    • Maria Laura Cunico

    Full Length Paper Open access 05 August 2022 Pages: 781 - 818

    

29. Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem

    • Henrique Becker
    • Olinto Araújo
    • Luciana S. Buriol

    Full Length Paper Open access 12 July 2022 Pages: 673 - 697

    

30. An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem

    • Francesco Cavaliere
    • Emilio Bendotti
    • Matteo Fischetti

    Full Length Paper Open access 02 July 2022 Pages: 749 - 779

    

31. Political districting to minimize cut edges

    • Hamidreza Validi
    • Austin Buchanan

    Full Length Paper 26 April 2022 Pages: 623 - 672

    

32. Allocation of fungible resources via a fast, scalable price discovery method

    • Akshay Agrawal
    • Stephen Boyd
    • Matei Zaharia

    Full Length Paper 18 April 2022 Pages: 593 - 622

    

33. Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization

    • Ching-pei Lee
    • Po-Wei Wang
    • Chih-Jen Lin

    Full Length Paper Open access 29 March 2022 Pages: 543 - 591

    

34. QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs

    • Ben Hermans
    • Andreas Themelis
    • Panagiotis Patrinos

    Full Length Paper 22 March 2022 Pages: 497 - 541

    

35. \(\mathtt {Tenscalc}\): a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria

    • João P. Hespanha

    Full Length Paper Open access 08 February 2022 Pages: 451 - 496

    

36. Efficient unconstrained black box optimization

    • Morteza Kimiaei
    • Arnold Neumaier

    Full Length Paper Open access 03 February 2022 Pages: 365 - 414

    

37. Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs

    • Yonggui Yan
    • Yangyang Xu

    Full Length Paper 03 February 2022 Pages: 319 - 363

    

38. A penalized method of alternating projections for weighted low-rank hankel matrix optimization

    • Jian Shen
    • Jein-Shan Chen
    • Naihua Xiu

    Full Length Paper Open access 03 February 2022 Pages: 417 - 450

    

39. LMBOPT: a limited memory method for bound-constrained optimization

    • Morteza Kimiaei
    • Arnold Neumaier
    • Behzad Azmi

    Full Length Paper Open access 10 January 2022 Pages: 271 - 318

    

40. Scalable branching on dual decomposition of stochastic mixed-integer programming problems

    • Kibaek Kim
    • Brian Dandurand

    Full Length Paper 04 January 2022 Pages: 1 - 41

    

41. Dantzig–Wolfe reformulations for binary quadratic problems

    • Alberto Ceselli
    • Lucas Létocart
    • Emiliano Traversi

    Full Length Paper 03 January 2022 Pages: 85 - 120

    

42. An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems

    • Meixia Lin
    • Defeng Sun
    • Kim-Chuan Toh

    Full Length Paper 08 November 2021 Pages: 223 - 270

    

43. Adaptive large neighborhood search for mixed integer programming

    • Gregor Hendel

    Full Length Paper Open access 08 November 2021 Pages: 185 - 221

    

44. Correction to: Asynchronous Lagrangian scenario decomposition

    • Ignacio Aravena
    • Anthony Papavasiliou

    Correction Open access 03 November 2021 Pages: 415 - 416

45. acados—a modular open-source framework for fast embedded optimal control

    • Robin Verschueren
    • Gianluca Frison
    • Moritz Diehl

    Full Length Paper 09 October 2021 Pages: 147 - 183

    

46. On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees

    • R. Andreani
    • G. Haeser
    • P. J. S. Silva

    Full Length Paper 18 September 2021 Pages: 121 - 146

    

47. An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization

    • Fei Li
    • Zheng Qu

    Full Length Paper 17 July 2021 Pages: 583 - 644

    

48. Deterministic global optimization with Gaussian processes embedded

    • Artur M. Schweidtmann
    • Dominik Bongartz
    • Alexander Mitsos

    Full Length Paper Open access 25 June 2021 Pages: 553 - 581

    

49. Optimal patchings for consecutive ones matrices

    • Marc E. Pfetsch
    • Giovanni Rinaldi
    • Paolo Ventura

    Full Length Paper Open access 07 June 2021 Pages: 43 - 84

    

50. Computational aspects of infeasibility analysis in mixed integer programming

    • Jakob Witzig
    • Timo Berthold
    • Stefan Heinz

    Full Length Paper Open access 06 March 2021 Pages: 753 - 785