Остановите войну!
for scientists:
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 20 matches
- 2017
- David Avis, Oliver Friedmann:
An exponential lower bound for Cunningham's rule. Math. Program. 161(1-2): 271-305 (2017) - Amitabh Basu, Richard Kipp Martin, Christopher Thomas Ryan:
Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. 161(1-2): 451-485 (2017) - Attila Bernáth, Gyula Pap:
Blocking optimal arborescences. Math. Program. 161(1-2): 583-601 (2017) - Víctor Blanco, Justo Puerto, Diego Ponce:
Continuous location under the effect of 'refraction'. Math. Program. 161(1-2): 33-72 (2017) - Merve Bodur, Sanjeeb Dash, Oktay Günlük:
Cutting planes from extended LP formulations. Math. Program. 161(1-2): 159-192 (2017) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161(1-2): 611-626 (2017) - Margarida Carvalho, Andrea Lodi, João Pedro Pedroso, Ana Viana:
Nash equilibria in the two-player kidney exchange game. Math. Program. 161(1-2): 389-417 (2017) - Venkat Chandrasekaran, Parikshit Shah:
Relative entropy optimization and its applications. Math. Program. 161(1-2): 1-32 (2017) - C. Charitha, Joydeep Dutta, D. Russell Luke:
Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities. Math. Program. 161(1-2): 519-549 (2017) - Liang Chen, Defeng Sun, Kim-Chuan Toh:
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161(1-2): 237-270 (2017) - Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint:
An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. 161(1-2): 73-134 (2017) - Mohammad Javad Feizollahi, Shabbir Ahmed, Andy Sun:
Exact augmented Lagrangian duality for mixed integer linear programming. Math. Program. 161(1-2): 365-387 (2017) - Karthik Natarajan, Chung-Piaw Teo:
On reduced semidefinite programs for second order moment bounds with applications. Math. Program. 161(1-2): 487-518 (2017) - Yunwei Qi, Suvrajeet Sen:
The Ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math. Program. 161(1-2): 193-235 (2017) - Maik Ringkamp, Sina Ober-Blöbaum, Sigrid Leyendecker:
On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function. Math. Program. 161(1-2): 551-581 (2017) - René Sitters:
Approximability of average completion time scheduling on unrelated machines. Math. Program. 161(1-2): 135-158 (2017) - Dávid Szeszlér:
Security games on matroids. Math. Program. 161(1-2): 347-364 (2017) - Adrien B. Taylor, Julien M. Hendrickx, François Glineur:
Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. 161(1-2): 307-345 (2017) - Mengdi Wang, Ethan X. Fang, Han Liu:
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Math. Program. 161(1-2): 419-449 (2017) - Laurence A. Wolsey:
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds. Math. Program. 161(1-2): 603-609 (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-06-29 14:38 CEST 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