


default search action
Mathematical 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

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.