Остановите войну!
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 14 matches
- 2014
- Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye:
Complexity of unconstrained $$L_2-L_p$$ minimization. Math. Program. 143(1-2): 371-383 (2014) - Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi:
Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1-2): 87-110 (2014) - Brendan P. W. Ames, Stephen A. Vavasis:
Convex optimization for the planted k-disjoint-clique problem. Math. Program. 143(1-2): 299-337 (2014) - Aharon Ben-Tal, Dick den Hertog:
Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143(1-2): 1-29 (2014) - Samuel Burer, Adam N. Letchford:
Unbounded convex sets for non-convex mixed-integer quadratic programming. Math. Program. 143(1-2): 231-256 (2014) - Marius Durea, Radu Strugariu:
Chain rules for linear openness in metric spaces and applications. Math. Program. 143(1-2): 147-176 (2014) - Frank Fischer, Christoph Helmberg:
Dynamic graph generation for the shortest path problem in time expanded networks. Math. Program. 143(1-2): 257-297 (2014) - Edward D. Kim:
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture. Math. Program. 143(1-2): 357-370 (2014) - Nathan Krislock, Jérôme Malick, Frédéric Roupin:
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Math. Program. 143(1-2): 61-86 (2014) - Kenneth Lange, Hua Zhou:
MM algorithms for geometric and signomial programming. Math. Program. 143(1-2): 339-356 (2014) - Quentin Louveaux, Laurent Poirrier:
An algorithm for the separation of two-row cuts. Math. Program. 143(1-2): 111-146 (2014) - Juan Pablo Luna, Claudia A. Sagastizábal, Mikhail V. Solodov:
A class of Dantzig-Wolfe type decomposition methods for variational inequality problems. Math. Program. 143(1-2): 177-209 (2014) - Julia Sponsel, Mirjam Dür:
Factorization and cutting planes for completely positive matrices by copositive projection. Math. Program. 143(1-2): 211-229 (2014) - Hailin Sun, Huifu Xu:
Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints. Math. Program. 143(1-2): 31-59 (2014)
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-05-07 12:42 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