default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 15 matches
- 2017
- Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking:
Truthful mechanism design via correlated tree rounding. Math. Program. 163(1-2): 445-469 (2017) - Afonso S. Bandeira, Nicolas Boumal, Amit Singer:
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization. Math. Program. 163(1-2): 145-167 (2017) - Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. 163(1-2): 301-358 (2017) - Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra Augusta Santos, Philippe L. Toint:
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1-2): 359-368 (2017) - Christoph Buchheim, Jannis Kurtz:
Min-max-min robust combinatorial optimization. Math. Program. 163(1-2): 1-23 (2017) - Jordi Castro, Stefano Nasini, Francisco Saldanha-da-Gama:
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1-2): 411-444 (2017) - Philip E. Gill, Vyacheslav Kungurtsev, Daniel P. Robinson:
A stabilized SQP method: superlinear convergence. Math. Program. 163(1-2): 369-410 (2017) - Vincent Guigues:
Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures. Math. Program. 163(1-2): 169-212 (2017) - Mingyi Hong, Xiangfeng Wang, Meisam Razaviyayn, Zhi-Quan Luo:
Iteration complexity analysis of block coordinate descent methods. Math. Program. 163(1-2): 85-114 (2017) - Rémi Imbach, Pascal Mathis, Pascal Schreck:
A robust and efficient method for solving point distance problems by homotopy. Math. Program. 163(1-2): 115-144 (2017) - Magnus Önnheim, Emil Gustavsson, Ann-Brith Strömberg, Michael Patriksson, Torbjörn Larsson:
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems. Math. Program. 163(1-2): 57-84 (2017) - Mustafa Ç. Pinar, Can Kizilkale:
Robust screening under ambiguity. Math. Program. 163(1-2): 273-299 (2017) - Birgit Rudloff, Firdevs Ulus, Robert J. Vanderbei:
A parametric simplex algorithm for linear vector optimization problems. Math. Program. 163(1-2): 213-242 (2017) - Balázs R. Sziklai, Tamás Fleiner, Tamás Solymosi:
On the core and nucleolus of directed acyclic graph games. Math. Program. 163(1-2): 243-271 (2017) - Alejandro Toriello, Nelson A. Uhan:
Dynamic linear programming games with risk-averse players. Math. Program. 163(1-2): 25-56 (2017)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-28 04:43 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint