Остановите войну!
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 47 matches
- 2010
- Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz:
Strategyproof Approximation of the Minimax on Networks. Math. Oper. Res. 35(3): 513-526 (2010) - Kent Andersen, Quentin Louveaux, Robert Weismantel:
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets. Math. Oper. Res. 35(1): 233-256 (2010) - Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010) - Hédy Attouch, Jérôme Bolte, Patrick Redont, Antoine Soubeyran:
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality. Math. Oper. Res. 35(2): 438-457 (2010) - Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010) - Erhan Bayraktar, Masahiko Egami:
On the One-Dimensional Optimal Switching Problem. Math. Oper. Res. 35(1): 140-159 (2010) - Dimitris Bertsimas, Xuan Vinh Doan, Karthik Natarajan, Chung-Piaw Teo:
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion. Math. Oper. Res. 35(3): 580-602 (2010) - Dimitris Bertsimas, Vineet Goyal:
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems. Math. Oper. Res. 35(2): 284-305 (2010) - Dimitris Bertsimas, Dan Andrei Iancu, Pablo A. Parrilo:
Optimality of Affine Policies in Multistage Robust Optimization. Math. Oper. Res. 35(2): 363-394 (2010) - Anna Bogomolnaia, Ron Holzman, Hervé Moulin:
Sharing the Cost of a Capacity Network. Math. Oper. Res. 35(1): 173-192 (2010) - Vincenzo Bonifaci, Tobias Harks, Guido Schäfer:
Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35(2): 330-346 (2010) - Ning Cai, Nan Chen, Xiangwei Wan:
Occupation Times of Jump-Diffusion Processes with Double Exponential Jumps and the Pricing of Options. Math. Oper. Res. 35(2): 412-437 (2010) - Xujin Chen, Zhibin Chen, Wenan Zang:
A Unified Approach to Box-Mengerian Hypergraphs. Math. Oper. Res. 35(3): 655-668 (2010) - Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli:
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010) - William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35(2): 479-493 (2010) - Jim G. Dai, Shuangchi He:
Customer Abandonment in Many-Server Queues. Math. Oper. Res. 35(2): 347-362 (2010) - Savas Dayanik:
Wiener Disorder Problem with Observations at Fixed Discrete Time Epochs. Math. Oper. Res. 35(4): 756-785 (2010) - A. B. Dieker, Jon Warren:
Series Jackson Networks and Noncrossing Probabilities. Math. Oper. Res. 35(2): 257-266 (2010) - Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Math. Oper. Res. 35(1): 1-13 (2010) - Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. Math. Oper. Res. 35(4): 786-794 (2010) - Mathieu Faure, Gregory Roth:
Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor. Math. Oper. Res. 35(3): 624-640 (2010) - Haolin Feng, Kumar Muthuraman:
A Computational Method for Stochastic Impulse Control Problems. Math. Oper. Res. 35(4): 830-850 (2010) - János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan, Koos Vrieze:
Perfect-Information Games with Lower-Semicontinuous Payoffs. Math. Oper. Res. 35(4): 742-755 (2010) - János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
Subgame Perfection in Positive Recursive Games with Perfect Information. Math. Oper. Res. 35(1): 193-207 (2010) - Serguei Foss, Andrew Richards:
On Sums of Conditionally Independent Subexponential Random Variables. Math. Oper. Res. 35(1): 102-119 (2010) - Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov:
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. Math. Oper. Res. 35(1): 14-26 (2010) - Simai He, Jiawei Zhang, Shuzhong Zhang:
Bounding Probability of Small Deviation: A Fourth Moment Approach. Math. Oper. Res. 35(1): 208-232 (2010) - Bernd Heidergott, Haralambie Leahu:
Weak Differentiability of Product Measures. Math. Oper. Res. 35(1): 27-51 (2010) - Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm:
Smoothing Techniques for Computing Nash Equilibria of Sequential Games. Math. Oper. Res. 35(2): 494-512 (2010) - Predrag R. Jelenkovic, Jian Tan:
Modulated Branching Processes, Origins of Power Laws, and Queueing Duality. Math. Oper. Res. 35(4): 807-829 (2010)
skipping 17 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-24 01:59 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