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 34 matches
- 2005
- Ivo J. B. F. Adan, Onno J. Boxma, David Perry:
The G/M/1 queue revisited. Math. Methods Oper. Res. 62(3): 437-452 (2005) - Hyun-Soo Ahn, Rhonda Righter, J. George Shanthikumar:
Staffing decisions for heterogeneous workers with turnover. Math. Methods Oper. Res. 62(3): 499-514 (2005) - Eitan Altman, Konstantin Avrachenkov, Richard Marquez, Gregory B. Miller:
Zero-sum constrained stochastic games with independent state processes. Math. Methods Oper. Res. 62(3): 375-386 (2005) - Arnon Arazi, Eshel Ben-Jacob, Uri Yechiali:
Controlling an oscillating Jackson-type network having state-dependent service rates. Math. Methods Oper. Res. 62(3): 453-466 (2005) - Harald Bauer, Ulrich Rieder:
Stochastic control problems with delay. Math. Methods Oper. Res. 62(3): 411-427 (2005) - Nicole Bäuerle:
Benchmark and mean-variance problems for insurers. Math. Methods Oper. Res. 62(1): 159-165 (2005) - Nikolai D. Botkin, Josef Stoer:
Minimization of convex functions on the convex hull of a point set. Math. Methods Oper. Res. 62(2): 167-185 (2005) - Rainer E. Burkard:
Preface. Math. Methods Oper. Res. 62(1): 1-2 (2005) - Nico M. van Dijk:
On product form tandem structures. Math. Methods Oper. Res. 62(3): 429-436 (2005) - Tyrone E. Duncan, Bozenna Pasik-Duncan, Lukasz Stettner:
Ergodic and adaptive control of hidden Markov models. Math. Methods Oper. Res. 62(2): 297-318 (2005) - Eugene A. Feinberg:
On essential information in sequential decision processes. Math. Methods Oper. Res. 62(3): 399-410 (2005) - Eugene A. Feinberg, Michael T. Curry:
Generalized Pinwheel Problem. Math. Methods Oper. Res. 62(1): 99-122 (2005) - S. Gajrat, Arie Hordijk:
On the structure of the optimal server control for fluid networks. Math. Methods Oper. Res. 62(1): 55-75 (2005) - Kevin D. Glazebrook, Emma L. Punton:
Fixed-time schedules for the processing of jobs when service completions are not observable. Math. Methods Oper. Res. 62(1): 77-97 (2005) - Catherine Gloaguen, F. Fleischer, Hendrik Schmidt, Volker Schmidt:
Simulation of typical Cox-Voronoi cells with a special regard to implementation tests. Math. Methods Oper. Res. 62(3): 357-373 (2005) - Karl Hinderer:
Lipschitz Continuity of Value Functions in Markovian Decision Processes. Math. Methods Oper. Res. 62(1): 3-22 (2005) - Yumei Huo, Joseph Y.-T. Leung:
Minimizing total completion time for UET tasks with release time and outtree precedence constraints. Math. Methods Oper. Res. 62(2): 275-279 (2005) - Lodewijk C. M. Kallenberg, Ger Koole, Flos Spieksma:
Special issue in honor of Arie Hordijk Editorial introduction. Math. Methods Oper. Res. 62(3): 347-349 (2005) - Ralf Korn, Olaf Menkens:
Worst-Case Scenario Portfolio Optimization: a New Stochastic Control Approach. Math. Methods Oper. Res. 62(1): 123-140 (2005) - Trine Krogh Kristoffersen:
Deviation Measures in Linear Two-Stage Stochastic Programming. Math. Methods Oper. Res. 62(2): 255-274 (2005) - Gang Li, Jiaowan Luo:
Upper and lower bounds for the solutions of Markov renewal equations. Math. Methods Oper. Res. 62(2): 243-253 (2005) - Thomas Lindner, Uwe T. Zimmermann:
Cost optimal periodic train scheduling. Math. Methods Oper. Res. 62(2): 281-295 (2005) - Ke Liu, Jerzy A. Filar:
Weighted singularly perturbed hybrid stochastic systems. Math. Methods Oper. Res. 62(1): 41-54 (2005) - Andrzej S. Nowak, Anna Jaskiewicz:
Nonzero-sum semi-Markov games with the expected average payoffs. Math. Methods Oper. Res. 62(1): 23-40 (2005) - Ad Ridder, Adam Shwartz:
Large deviations without principle: join the shortest queue. Math. Methods Oper. Res. 62(3): 467-483 (2005) - Sheldon M. Ross:
Extending simulation uses of antithetic variables: partially monotone functions, random permutations, and random subsets. Math. Methods Oper. Res. 62(3): 351-356 (2005) - Manfred Schäl:
Control of ruin probabilities by discrete-time investments. Math. Methods Oper. Res. 62(1): 141-158 (2005) - Karel Sladký:
On mean reward variance in semi-Markov processes. Math. Methods Oper. Res. 62(3): 387-397 (2005) - Shaler Stidham Jr.:
On the optimality of a full-service policy for a queueing system with discounted costs. Math. Methods Oper. Res. 62(3): 485-497 (2005) - A. Taa:
ɛ-Subdifferentials of Set-valued Maps and ɛ-Weak Pareto Optimality for Multiobjective Optimization. Math. Methods Oper. Res. 62(2): 187-209 (2005)
skipping 4 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-07 08:29 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