Остановите войну!
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 19 matches
- 2023
- Nicole Bäuerle, Tamara Göll:
Nash equilibria for relative investors via no-arbitrage arguments. Math. Methods Oper. Res. 97(1): 1-23 (2023) - Fernando García Castaño, Miguel A. Melguizo Padial, G. Parzanese:
Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization. Math. Methods Oper. Res. 97(3): 367-382 (2023) - Yu-Hong Dai, Fangfang Xu, Liwei Zhang:
Alternating direction method of multipliers for linear hyperspectral unmixing. Math. Methods Oper. Res. 97(3): 289-310 (2023) - Savas Dayanik, Semih Onur Sezer:
Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising. Math. Methods Oper. Res. 97(1): 25-56 (2023) - Yanyun Ding, Peili Li, Yunhai Xiao, Haibin Zhang:
Efficient dual ADMMs for sparse compressive sensing MRI reconstruction. Math. Methods Oper. Res. 97(2): 207-231 (2023) - Montacer Essid, Esteban G. Tabak, Giulio Trigila:
An implicit gradient-descent procedure for minimax problems. Math. Methods Oper. Res. 97(1): 57-89 (2023) - Nicolas Gast, Bruno Gaujal, Kimang Khun:
Testing indexability and computing Whittle and Gittins index in subcubic time. Math. Methods Oper. Res. 97(3): 391-436 (2023) - José-Manuel Giménez-Gómez, Peter Sudhölter, Cori Vilella:
Average monotonic cooperative games with nontransferable utility. Math. Methods Oper. Res. 97(3): 383-390 (2023) - Yonghui Huang, Zhaotong Lian, Xianping Guo:
Zero-sum infinite-horizon discounted piecewise deterministic Markov games. Math. Methods Oper. Res. 97(2): 179-205 (2023) - Adam Jonsson:
An axiomatic approach to Markov decision processes. Math. Methods Oper. Res. 97(1): 117-133 (2023) - Tomasz Kosmala, Randall Martyr, John Moriarty:
Markov risk mappings and risk-sensitive optimal prediction. Math. Methods Oper. Res. 97(1): 91-116 (2023) - Zijun Li, Fanyong Meng:
The α-Egalitarian Myerson value of games with communication structure. Math. Methods Oper. Res. 97(3): 311-338 (2023) - Martin Olsen, Lars Nørvang Andersen, Allan Gross:
An asymptotically optimal algorithm for online stacking. Math. Methods Oper. Res. 97(2): 161-178 (2023) - Oliver Stein:
2022 MMOR best paper award. Math. Methods Oper. Res. 97(2): 159-160 (2023) - Seyfe Belete Worku, Birilew Belayneh Tsegaw, Semu Mitiku Kassa:
Existence and computations of best affine strategies for multilevel reverse Stackelberg games. Math. Methods Oper. Res. 97(3): 339-366 (2023) - Jianqing Fisher Wu, Banafsheh Behzad:
Optimal three-part tariff pricing with Spence-Mirrlees reservation prices. Math. Methods Oper. Res. 97(2): 233-258 (2023) - Wei Yu:
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover. Math. Methods Oper. Res. 97(1): 135-157 (2023) - Sixiang Zhao:
Decision rule-based method in solving adjustable robust capacity expansion problem. Math. Methods Oper. Res. 97(2): 259-286 (2023) - Sixiang Zhao:
Correction to: Decision rule-based method in solving adjustable robust capacity expansion problem. Math. Methods Oper. Res. 97(2): 287 (2023)
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-02 19:54 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