Остановите войну!
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 77 matches
- 2016
- Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. Math. Oper. Res. 41(3): 1022-1038 (2016) - Daniel Adelman, Angelo J. Mancini:
Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes. Math. Oper. Res. 41(4): 1222-1247 (2016) - Aurélien Alfonsi, Florian Klöck, Alexander Schied:
Multivariate Transient Price Impact and Matrix-Valued Positive Definite Functions. Math. Oper. Res. 41(3): 914-934 (2016) - Alessandro Arlotto, J. Michael Steele:
A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming. Math. Oper. Res. 41(4): 1448-1468 (2016) - Rami Atar, Asaf Cohen:
A Differential Game for a Multiclass Queueing Model in the Moderate-Deviation Heavy-Traffic Regime. Math. Oper. Res. 41(4): 1354-1380 (2016) - Dieter Balkenborg, Dries Vermeulen:
Where Strategic and Evolutionary Stability Depart - A Study of Minimal Diversity Games. Math. Oper. Res. 41(1): 278-292 (2016) - Heinz H. Bauschke, Warren L. Hare, Walaa M. Moursi:
On the Range of the Douglas-Rachford Operator. Math. Oper. Res. 41(3): 884-897 (2016) - Erhan Bayraktar, Yuchong Zhang:
Fundamental Theorem of Asset Pricing Under Transaction Costs and Model Uncertainty. Math. Oper. Res. 41(3): 1039-1054 (2016) - Amir Beck, Nadav Hallak:
On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms. Math. Oper. Res. 41(1): 196-223 (2016) - Adrien Blanchet, Guillaume Carlier:
Optimal Transport and Cournot-Nash Equilibria. Math. Oper. Res. 41(1): 125-145 (2016) - Jérôme Bolte, Edouard Pauwels:
Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs. Math. Oper. Res. 41(2): 442-465 (2016) - Bruno Bouchard, Marcel Nutz:
Stochastic Target Games and Dynamic Programming via Regularized Viscosity Solutions. Math. Oper. Res. 41(1): 109-124 (2016) - Mark Braverman, Jing Chen, Sampath Kannan:
Optimal Provision-After-Wait in Healthcare. Math. Oper. Res. 41(1): 352-376 (2016) - Mario Bravo:
An Adjusted Payoff-Based Procedure for Normal Form Games. Math. Oper. Res. 41(4): 1469-1483 (2016) - Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - Yang Cai, Ozan Candogan, Constantinos Daskalakis, Christos H. Papadimitriou:
Zero-Sum Polymatrix Games: A Generalization of Minmax. Math. Oper. Res. 41(2): 648-655 (2016) - Laurence Carassus, Miklós Rásonyi:
Maximization of Nonconcave Utility Functions in Discrete-Time Financial Market Models. Math. Oper. Res. 41(1): 146-173 (2016) - Pierre Cardaliaguet, Catherine Rainer, Dinah Rosenberg, Nicolas Vieille:
Markov Games with Frequent Actions and Incomplete Information - The Limit Case. Math. Oper. Res. 41(1): 49-71 (2016) - Rolando Cavazos-Cadena, Daniel Hernández-Hernández:
A Characterization of the Optimal Certainty Equivalent of the Average Cost via the Arrow-Pratt Sensitivity Function. Math. Oper. Res. 41(1): 224-235 (2016) - Deeparnab Chakrabarty, Chaitanya Swamy:
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems. Math. Oper. Res. 41(3): 865-883 (2016) - Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala:
The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. 41(1): 23-48 (2016) - Arthur Charpentier, Alfred Galichon, Marc Henry:
Local Utility and Multivariate Risk Aversion. Math. Oper. Res. 41(2): 466-476 (2016) - Qin Chen, Xujin Chen, Wenan Zang:
A Polyhedral Description of Kernels. Math. Oper. Res. 41(3): 969-990 (2016) - Patrick Cheridito, Ulrich Horst, Michael Kupper, Traian A. Pirvu:
Equilibrium Pricing in Incomplete Markets Under Translation Invariant Preferences. Math. Oper. Res. 41(1): 174-195 (2016) - Thai Doan Chuong, Do Sang Kim:
Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions. Math. Oper. Res. 41(2): 596-611 (2016) - Roberto Cominetti, Alfredo Torrico:
Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks. Math. Oper. Res. 41(4): 1510-1521 (2016) - Leon Cui, Tolga Tezcan:
Approximations for Chat Service Systems Using Many-Server Diffusion Limits. Math. Oper. Res. 41(3): 775-807 (2016) - Min Dai, Zhou Yang, Qing Zhang, Qiji Jim Zhu:
Optimal Trend Following Trading Rules. Math. Oper. Res. 41(2): 626-642 (2016) - Savas Dayanik, Semih Onur Sezer:
Sequential Sensor Installation for Wiener Disorder Detection. Math. Oper. Res. 41(3): 827-850 (2016) - Darinka Dentcheva, Eli Wolfhagen:
Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints. Math. Oper. Res. 41(1): 1-22 (2016)
skipping 47 more matches
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-08 05:48 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