default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming Computation, Volume 12
Volume 12, Number 1, March 2020
- Ewout van den Berg:
A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising. 1-38 - Michael Bastubbe
, Marco E. Lübbecke:
A branch-and-price algorithm for capacitated hypergraph vertex separation. 39-68 - Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas, François Margot:
Partial hyperplane activation for generalized intersection cuts. 69-107 - Guanglei Wang, Hassan L. Hijazi:
Exploiting sparsity for the min k-partition problem. 109-130
Volume 12, Number 2, June 2020
- Daniel Bienstock, Giacomo Nannicini:
Special issue forward: the 2018 Mixed Integer Programming workshop. 131 - Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi:
On integer and bilevel formulations for the k-vertex cut problem. 133-164 - Alberto Del Pia, Aida Khajavirad, Nikolaos V. Sahinidis:
On the impact of running intersection inequalities for globally solving polynomial optimization problems. 165-191 - Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann:
K-adaptability in two-stage mixed-integer robust optimization. 193-224 - Bernard Knueven, James Ostrowski, Jean-Paul Watson:
A novel matching formulation for startup costs in unit commitment. 225-248 - Chris Coey, Miles Lubin, Juan Pablo Vielma:
Outer approximation with conic certificates for mixed-integer convex problems. 249-293 - Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang:
Split cuts from sparse disjunctions. 295-335
Volume 12, Number 3, September 2020
- Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Robust Euclidean embedding via EDM optimization. 337-387 - Simon Bowly, Kate Smith-Miles, Davaatseren Baatar, Hans D. Mittelmann:
Generation techniques for linear programming instances with controllable properties. 389-415 - Antoine Legrain, Jérémy Omer, Samuel Rosat:
A rotation-based branch-and-price approach for the nurse scheduling problem. 417-450 - Quoc Tran-Dinh, Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
An adaptive primal-dual framework for nonsmooth convex minimization. 451-491 - Hosseinali Salemi, Austin Buchanan:
Parsimonious formulations for low-diameter clusters. 493-528
Volume 12, Number 4, December 2020
- Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre:
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. 529-568 - Shujun Bi, Shaohua Pan, Defeng Sun:
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. 569-602 - Lukas Schork, Jacek Gondzio:
Implementation of an interior point method with basis preconditioning. 603-635 - Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, Stephen P. Boyd:
OSQP: an operator splitting solver for quadratic programs. 637-672 - Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables. 673-702
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.
last updated on 2025-05-02 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
