


default search action
Mathematical Programming Computation, Volume 13
Volume 13, Number 1, March 2021
- Ignacio Aravena, Anthony Papavasiliou:
Asynchronous Lagrangian scenario decomposition. 1-50 - Stefan Hougardy, Xianghui Zhong
:
Hard to solve instances of the Euclidean Traveling Salesman Problem. 51-74 - Christopher Hojny
, Imke Joormann
, Hendrik Lüthen, Martin Schmidt
:
Mixed-integer programming techniques for the connected max-k-cut problem. 75-132 - Laurent D. Michel
, Pierre Schaus, Pascal Van Hentenryck:
MiniCP: a lightweight solver for constraint programming. 133-184 - Daniel Blado, Alejandro Toriello
:
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes. 185-223
Volume 13, Number 2, June 2021
- Christian Tjandraatmadja, Willem-Jan van Hoeve:
Incorporating bounds from decision diagrams into integer programming. 225-256 - Riley Murray
, Venkat Chandrasekaran, Adam Wierman:
Signomial and polynomial optimization via relative entropy and partial dualization. 257-295 - Riley Murray, Venkat Chandrasekaran, Adam Wierman:
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization. 297-299 - Ashutosh Mahajan, Sven Leyffer
, Jeff T. Linderoth, James R. Luedtke, Todd S. Munson:
Minotaur: a mixed-integer nonlinear optimization toolkit. 301-338 - Kresimir Mihic
, Mingxi Zhu
, Yinyu Ye:
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization. 339-413 - Winfried Bruns, Bogdan Ichim
:
Polytope volume by descent in the face lattice and applications in social choice. 415-442
Volume 13, Number 3, September 2021
- Ambros M. Gleixner
, Gregor Hendel
, Gerald Gamrath
, Tobias Achterberg, Michael Bastubbe
, Timo Berthold
, Philipp Christophel
, Kati Jarck, Thorsten Koch
, Jeff T. Linderoth
, Marco E. Lübbecke
, Hans D. Mittelmann
, Derya B. Özyurt
, Ted K. Ralphs
, Domenico Salvagnin
, Yuji Shinano
:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. 443-490 - Nikolaos Ploskas, Nikolaos V. Sahinidis, Nikolaos Samaras:
A triangulation and fill-reducing initialization procedure for the simplex algorithm. 491-508 - Mathieu Tanneau
, Miguel F. Anjos
, Andrea Lodi
:
Design and implementation of a modular interior-point solver for linear optimization. 509-551 - Artur M. Schweidtmann
, Dominik Bongartz
, Daniel Grothe, Tim Kerkenhoff, Xiaopeng Lin, Jaromil Najman, Alexander Mitsos
:
Deterministic global optimization with Gaussian processes embedded. 553-581 - Fei Li, Zheng Qu
:
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization. 583-644
Volume 13, Number 4, December 2021
- Giacomo Nannicini, Emiliano Traversi
, Roberto Wolfler Calvo:
A Benders squared (B2) framework for infinite-horizon stochastic linear programs. 645-681 - Nicolò Mazzi, Andreas Grothey, Ken McKinnon, Nagisa Sugishita:
Benders decomposition with adaptive oracles for large scale optimization. 683-703 - Rohit Kannan
, James R. Luedtke:
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. 705-751 - Jakob Witzig
, Timo Berthold
, Stefan Heinz:
Computational aspects of infeasibility analysis in mixed integer programming. 753-785

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
