default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming Computation, Volume 14
Volume 14, Number 1, March 2022
- Kibaek Kim
, Brian C. Dandurand:
Scalable branching on dual decomposition of stochastic mixed-integer programming problems. 1-41 - Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura:
Optimal patchings for consecutive ones matrices. 43-84 - Alberto Ceselli, Lucas Létocart, Emiliano Traversi:
Dantzig-Wolfe reformulations for binary quadratic problems. 85-120 - Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Leonardo D. Secchin, Paulo J. S. Silva:
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees. 121-146 - Robin Verschueren, Gianluca Frison, Dimitris Kouzoupis, Jonathan Frey, Niels van Duijkeren, Andrea Zanelli, Branimir Novoselnik, Thivaharan Albin, Rien Quirynen, Moritz Diehl:
acados - a modular open-source framework for fast embedded optimal control. 147-183
Volume 14, Number 2, June 2022
- Gregor Hendel:
Adaptive large neighborhood search for mixed integer programming. 185-221 - Meixia Lin, Defeng Sun, Kim-Chuan Toh:
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems. 223-270 - Morteza Kimiaei, Arnold Neumaier, Behzad Azmi:
LMBOPT: a limited memory method for bound-constrained optimization. 271-318 - Yonggui Yan, Yangyang Xu:
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs. 319-363 - Morteza Kimiaei, Arnold Neumaier:
Efficient unconstrained black box optimization. 365-414 - Ignacio Aravena, Anthony Papavasiliou:
Correction to: Asynchronous Lagrangian scenario decomposition. 415-416
Volume 14, Number 3, September 2022
- Jian Shen, Jein-Shan Chen, Hou-Duo Qi, Naihua Xiu:
A penalized method of alternating projections for weighted low-rank hankel matrix optimization. 417-450 - João P. Hespanha:
$\mathtt {Tenscalc}$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria. 451-496 - Ben Hermans, Andreas Themelis, Panagiotis Patrinos:
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs. 497-541 - Ching-Pei Lee, Po-Wei Wang, Chih-Jen Lin:
Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization. 543-591 - Akshay Agrawal, Stephen P. Boyd, Deepak Narayanan, Fiodar Kazhamiaka, Matei Zaharia:
Allocation of fungible resources via a fast, scalable price discovery method. 593-622
Volume 14, Number 4, December 2022
- Hamidreza Validi, Austin Buchanan:
Political districting to minimize cut edges. 623-672 - Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol:
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem. 673-697 - Jordan Jalving, Sungho Shin, Victor M. Zavala:
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl. 699-747 - Francesco Cavaliere, Emilio Bendotti, Matteo Fischetti:
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem. 749-779 - Melina C. Vidoni, Maria Laura Cunico:
On technical debt in mathematical programming: An exploratory study. 781-818
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-01-26 23:35 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:
