default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming Computation, Volume 10
Volume 10, Number 1, March 2018
- Tillmann Weißer, Jean B. Lasserre, Kim-Chuan Toh:
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. 1-32 - Tobias Fischer, Marc E. Pfetsch
:
Branch-and-cut for linear programs with overlapping SOS1 constraints. 33-68 - Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. 69-118 - Qi Huangfu, J. A. J. Hall:
Parallelizing the dual revised simplex method. 119-142
Volume 10, Number 2, June 2018
- Ben Knueven, Jim Ostrowski, Sebastian Pokutta:
Detecting almost symmetries of graphs. 143-185 - Bethany Nicholson, John D. Siirola, Jean-Paul Watson, Victor M. Zavala, Lorenz T. Biegler:
pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations. 187-223 - Kibaek Kim, Victor M. Zavala:
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs. 225-266 - David Avis, Charles Jordan:
mplrs: A scalable parallel vertex/facet enumeration code. 267-302
Volume 10, Number 3, September 2018
- Jeffrey Larson, Stefan M. Wild:
Asynchronously parallel optimization solver for finding multiple minima. 303-332 - Pierre Bonami, Oktay Günlük, Jeff T. Linderoth:
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. 333-382 - Aida Khajavirad, Nikolaos V. Sahinidis:
A hybrid LP/NLP paradigm for global optimization relaxations. 383-421 - Ricardo Fukasawa, Laurent Poirrier, Álinson S. Xavier:
Intersection cuts for single row corner relaxations. 423-455
Volume 10, Number 4, December 2018
- Hande Y. Benson, David F. Shanno:
Cubic regularization in symmetric rank-1 quasi-Newton methods. 457-486 - Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen:
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. 487-532 - Yunhai Xiao, Liang Chen, Donghui Li:
A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming. 533-555 - Burak Kocuk, Santanu S. Dey, Xu Andy Sun:
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. 557-596 - Alberto Costa, Giacomo Nannicini:
RBFOpt: an open-source library for black-box optimization with costly function evaluations. 597-629 - Danilo Elias Oliveira, Henry Wolkowicz, Yangyang Xu:
ADMM for the SDP relaxation of the QAP. 631-658 - Cynthia Rudin, Seyda Ertekin:
Learning customized and optimized lists of rules with mathematical programming. 659-702 - Xudong Li, Defeng Sun, Kim-Chuan Toh:
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming. 703-743
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 2024-10-31 20:05 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:
