default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 177
Volume 177, Numbers 1-2, September 2019
- Euiwoong Lee
:
Partitioning a graph into small pieces with applications to path transversal. 1-19 - Juan Pablo Vielma:
Small and strong formulations for unions of convex sets from the Cayley embedding. 21-53 - Ali Aouad, Danny Segev:
The ordered k-median problem: surrogate models and approximation algorithms. 55-83 - Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
Exact and approximation algorithms for weighted matroid intersection. 85-112 - Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Exploiting problem structure in optimization under uncertainty via online convex optimization. 113-147 - M. Seetharama Gowda, David Sossa:
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones. 149-171 - Quoc Tran-Dinh, Tianxiao Sun, Shu Lu:
Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms. 173-223 - Yanli Liu, Ernest K. Ryu, Wotao Yin:
A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs. 225-253 - Xiaojun Chen, Hailin Sun, Huifu Xu:
Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems. 255-289 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. 291-320 - Do Sang Kim, Tien Son Pham, Nguyen Van Tuyen:
On the existence of Pareto solutions for polynomial vector optimization problems. 321-341 - Sabrina Fiege, Andrea Walther, Andreas Griewank:
An algorithm for nonsmooth optimization by successive piecewise linearization. 343-370 - Alberto Del Pia, Jeffrey Poskin:
Characterizations of mixed binary convex quadratic representable sets. 371-394 - Johannes O. Royset, Roger J.-B. Wets:
Lopsided convergence: an extension and its quantification. 395-423 - Christian Kanzow, Daniel Steck:
Improved local convergence results for augmented Lagrangian methods in $${\varvec{C}}^\mathbf{2}$$ C 2 -cone reducible constrained optimization. 425-438
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-02-24 21:20 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:
