default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming Computation, Volume 17
Volume 17, Number 1, March 2025
- Jean-Pierre Dussault
, Jean Charles Gilbert, Baptiste Plaquevent-Jourdain:
On the B-differential of the componentwise minimum of two affine vector functions. 1-52 - Richard J. Clancy, Stephen Becker:
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty. 53-79 - Jonas Hall, Armin Nurkanovic, Florian Messerer, Moritz Diehl:
LCQPow: a solver for linear complementarity quadratic programs. 81-109 - Domenico Salvagnin, Roberto Roberti, Matteo Fischetti:
A fix-propagate-repair heuristic for mixed integer programming. 111-139 - Jinchang Hu, Mingzhou Jin:
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect. 141-171
Volume 17, Number 2, June 2025
- Nachuan Xiao, Xiaoyin Hu, Xin Liu, Kim-Chuan Toh:
CDOpt: a Python package for a class of Riemannian optimization. 173-230 - Marco Locatelli, Veronica Piccialli, Antonio Maria Sudoso:
Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints. 231-263 - Julien Codsi, Sandra Ulrich Ngueveu, Bernard Gendron:
LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization. 265-306 - Jake Roth, Ying Cui:
On O(n) algorithms for projection onto the top-k-sum sublevel set. 307-348 - Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer, Max Huneshagen:
K-shortest simple paths using biobjective path search. 349-384 - Daniel de Roux, Robert Carr, R. Ravi:
Instance-specific linear relaxations of semidefinite optimization problems. 385-435
Volume 17, Number 3, September 2025
- Timo Berthold, Matteo Francobaldi, Gregor Hendel:
Learning to use local cuts. 437-450 - Zheng Qu, Tianyou Zeng, Yuchen Lou:
Globally solving concave quadratic programs via doubly nonnegative relaxation. 451-503 - Morteza Kimiaei, Arnold Neumaier:
MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization. 505-546 - Xiaomeng Hu, Jiawang Nie:
Polynomial optimization relaxations for generalized semi-infinite programs. 547-583 - Yancheng Yuan, Meixia Lin, Defeng Sun, Kim-Chuan Toh:
Adaptive sieving: a dimension reduction technique for sparse optimization problems. 585-616
Volume 17, Number 4, December 2025
- Immanuel M. Bomze, Bo Peng, Yuzhou Qiu, E. Alper Yildirim:
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization. 617-651 - Iyad Walwil, Olivier Fercoq:
The smoothed duality gap as a stopping criterion. 653-697 - Javier Marenco:
A general cut-generating strategy for the caterpillar-packing polytope. 699-730 - Deborah Hendrych, Hannah Troppens, Mathieu Besançon, Sebastian Pokutta:
Convex mixed-integer optimization with Frank-Wolfe methods. 731-757 - Raúl Martín-Santamaría, Anna Martínez-Gavara, A. D. López-Sánchez, Manuel Laguna:
Multiparent path relinking. An application to the power dominating set problem. 759-779
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-12-05 22:25 CET 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:
