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 37 matches
- 2012
- Itai Ashlagi, Shahar Dobzinski, Ron Lavi:
Optimal Lower Bounds for Anonymous Scheduling Mechanisms. Math. Oper. Res. 37(2): 244-258 (2012) - Amitabh Basu, Gérard Cornuéjols, Matthias Köppe:
Unique Minimal Liftings for Simplicial Polytopes. Math. Oper. Res. 37(2): 346-355 (2012) - Amitabh Basu, Gérard Cornuéjols, François Margot:
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37(1): 21-40 (2012) - Arnab Basu, Mrinal K. Ghosh:
Zero-Sum Risk-Sensitive Stochastic Differential Games. Math. Oper. Res. 37(3): 437-449 (2012) - Johannes Gerd Becker:
A Note on the Number of α-Pivotal Players. Math. Oper. Res. 37(1): 196-200 (2012) - Dimitri P. Bertsekas, Huizhen Yu:
Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming. Math. Oper. Res. 37(1): 66-94 (2012) - Bruno Bouchard, Thanh Nam Vu:
A Stochastic Target Approach for P&L Matching Problems. Math. Oper. Res. 37(3): 526-558 (2012) - R. Anton Braun, Huiyu Li, John Stachurski:
Generalized Look-Ahead Methods for Computing Stationary Densities. Math. Oper. Res. 37(3): 489-500 (2012) - Amarjit Budhiraja, Xin Liu:
Stability of Constrained Markov-Modulated Diffusions. Math. Oper. Res. 37(4): 626-653 (2012) - Ana Busic, Ingrid M. H. Vliegen, Alan Scheller-Wolf:
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems. Math. Oper. Res. 37(2): 259-287 (2012) - Dragos Florin Ciocan, Vivek F. Farias:
Model Predictive Control for Dynamic Resource Allocation. Math. Oper. Res. 37(3): 501-525 (2012) - José R. Correa, Martin Skutella, José Verschae:
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Math. Oper. Res. 37(2): 379-398 (2012) - Eugene A. Feinberg, Pavlo O. Kasyanov, Nina V. Zadoianchuk:
Average Cost Markov Decision Processes with Weakly Continuous Transition Probabilities. Math. Oper. Res. 37(4): 591-607 (2012) - Eugene A. Feinberg, Uriel G. Rothblum:
Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes. Math. Oper. Res. 37(1): 129-153 (2012) - Gadi Fibich, Nir Gavish:
Asymmetric First-Price Auctions - A Dynamical-Systems Approach. Math. Oper. Res. 37(2): 219-243 (2012) - Sergey Foss, Dmitry Korshunov:
On Large Delays in Multi-Server Queues with Heavy Tails. Math. Oper. Res. 37(2): 201-218 (2012) - Tobias Harks, Max Klimm:
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Math. Oper. Res. 37(3): 419-436 (2012) - René Henrion, Andris Möller:
A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution. Math. Oper. Res. 37(3): 475-488 (2012) - Stefanus Jasin, Sunil Kumar:
A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice. Math. Oper. Res. 37(2): 313-345 (2012) - Ravindran Kannan, Hariharan Narayanan:
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. 37(1): 1-20 (2012) - Offer Kella, S. Ramasubramanian:
Asymptotic Irrelevance of Initial Conditions for Skorohod Reflection Mapping on the Nonnegative Orthant. Math. Oper. Res. 37(2): 301-312 (2012) - Shuji Kijima, Toshio Nemoto:
On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings. Math. Oper. Res. 37(2): 356-371 (2012) - Jesús A. De Loera, Steven Klee:
Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable. Math. Oper. Res. 37(4): 670-674 (2012) - Avishai Mandelbaum, Petar Momcilovic:
Queues with Many Servers and Impatient Customers. Math. Oper. Res. 37(1): 41-65 (2012) - Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. Math. Oper. Res. 37(4): 559-573 (2012) - Hiroki Nishimura, Efe A. Ok:
Solvability of Variational Inequalities on Hilbert Lattices. Math. Oper. Res. 37(4): 608-625 (2012) - Alberto Del Pia:
On the Rank of Disjunctive Cuts. Math. Oper. Res. 37(2): 372-378 (2012) - Jérôme Renault:
The Value of Repeated Games with an Informed Controller. Math. Oper. Res. 37(1): 154-179 (2012) - Yosef Rinott, Marco Scarsini, Yaming Yu:
A Colonel Blotto Gladiator Game. Math. Oper. Res. 37(4): 574-590 (2012) - Ali Devin Sezer, Çagri Haksöz:
Optimal Decision Rules for Product Recalls. Math. Oper. Res. 37(3): 399-418 (2012)
skipping 7 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-11-25 15:51 CET 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