Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 171
Volume 171, Numbers 1-2, September 2018
- Frank Permenter, Pablo A. Parrilo
:
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone. 1-54 - Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust flows over time: models and complexity results. 55-85 - Satoru Fujishige, Shin-ichi Tanigawa:
Polynomial combinatorial algorithms for skew-bisubmodular function minimization. 87-114 - Peyman Mohajerin Esfahani, Daniel Kuhn:
Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. 115-166 - Guanghui Lan, Yi Zhou:
An optimal randomized incremental gradient method. 167-215 - Dimitris Bertsimas, Vishal Gupta, Nathan Kallus:
Robust sample average approximation. 217-282 - Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold:
The diameters of network-flow polytopes satisfy the Hirsch conjecture. 283-309 - Yurii E. Nesterov:
Complexity bounds for primal-dual methods minimizing the model of objective function. 311-330 - Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta:
Aggregation-based cutting-planes for packing and covering integer programs. 331-359 - Jane J. Ye, Jinchuan Zhou:
Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems. 361-395 - Anupam Prakash, Jamie Sikora, Antonios Varvitsiotis, Zhaohui Wei:
Completely positive semidefinite rank. 397-431 - Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New algorithms for maximum disjoint paths based on tree-likeness. 433-461 - M. H. Li, K. W. Meng, Xiaoqi Yang:
On error bound moduli for locally Lipschitz and regular functions. 463-487 - Michael J. Todd:
On max-k-sums. 489-517 - Jonas T. Witt, Marco E. Lübbecke, Bruce A. Reed:
Polyhedral results on the stable set problem in graphs containing even or odd pairs. 519-522
a service of 
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-07-03 21:34 CEST 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:
