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
- 2003
- P. S. Ansell, Kevin D. Glazebrook, José Niño-Mora, M. O'Keeffe:
Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57(1): 21-39 (2003) - Vadim Azhmyakov, Werner H. Schmidt:
Strong convergence of a proximal-based method for convex optimization. Math. Methods Oper. Res. 57(3): 393-407 (2003) - Joël Benoist, Nicolae Popovici:
Characterizations of convex and quasiconvex set-valued maps. Math. Methods Oper. Res. 57(3): 427-435 (2003) - Oded Berman, Dmitry Krass, David Perry:
A transfer/clearing inventory model under sporadic review. Math. Methods Oper. Res. 57(2): 329-344 (2003) - Mourad Boudhar:
Scheduling a batch processing machine with bipartite compatibility graphs. Math. Methods Oper. Res. 57(3): 513-527 (2003) - Rodica Branzei, Fernanda Scotti, Stef Tijs, Anna Torre:
Discretization of information collecting situations and continuity of compensation rules. Math. Methods Oper. Res. 57(2): 299-308 (2003) - Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57(2): 217-234 (2003) - María J. Cánovas, Marco A. López, Eva-María Ortega, Juan Parra:
Upper semicontinuity of closed-convex-valued multifunctions. Math. Methods Oper. Res. 57(3): 409-425 (2003) - Rolando Cavazos-Cadena:
Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space. Math. Methods Oper. Res. 57(2): 263-285 (2003) - Gennady Diubin, Alexander Korbut:
The average behaviour of greedy algorithms for the knapsack problem: General distributions. Math. Methods Oper. Res. 57(3): 449-479 (2003) - Mirjam Dür:
A parametric characterization of local optimality. Math. Methods Oper. Res. 57(1): 101-109 (2003) - Encarnación Algaba Durán, Jesús Mario Bilbao, René van den Brink, Andrés Jiménez-Losada:
Axiomatizations of the Shapley value for cooperative games on antimatroids. Math. Methods Oper. Res. 57(1): 49-65 (2003) - Wolfgang Espelage, Egon Wanke:
Movement minimization for unit distances in conveyor flow shop processing. Math. Methods Oper. Res. 57(2): 173-206 (2003) - Evgueni Gordienko, Alexander Yushkevich:
Stability estimates in the problem of average optimal switching of a Markov chain. Math. Methods Oper. Res. 57(3): 345-365 (2003) - Karl Hinderer, Karl-Heinz Waldmann:
The critical discount factor for finite Markovian decision processes with an absorbing set. Math. Methods Oper. Res. 57(1): 1-19 (2003) - Juri Hinz:
Optimal bid strategies for electricity auctions. Math. Methods Oper. Res. 57(1): 157-171 (2003) - Jau-Chuan Ke:
The operating characteristic analysis on a general input queue with N policy and a startup time. Math. Methods Oper. Res. 57(2): 235-254 (2003) - Anna B. Khmelnitskaya, Theo S. H. Driessen:
Semiproportional values for TU games. Math. Methods Oper. Res. 57(3): 495-511 (2003) - Werner Krabs:
A cooperative treatment of an n-person cost-goal-game. Math. Methods Oper. Res. 57(2): 309-319 (2003) - S. J. Li, Hong Yan, Guang-Ya Chen:
Differential and sensitivity properties of gap functions for vector variational inequalities. Math. Methods Oper. Res. 57(3): 377-391 (2003) - Natividad Llorca, Stef Tijs, Judith Timmer:
Semi-infinite assignment problems and related games. Math. Methods Oper. Res. 57(1): 67-78 (2003) - Ana Meca, Ignacio García-Jurado, Peter Borm:
Cooperation and competition in inventory games. Math. Methods Oper. Res. 57(3): 481-493 (2003) - Kaisa Miettinen, Marko M. Mäkelä:
Characterizing generalized trade-off directions. Math. Methods Oper. Res. 57(1): 89-100 (2003) - Alfred Müller, Marco Scarsini:
Sensitivity analysis of a sequential decision problem with learning. Math. Methods Oper. Res. 57(2): 321-327 (2003) - Alix Munier, Francis Sourd:
Scheduling chains on a single machine with non-negative time lags. Math. Methods Oper. Res. 57(1): 111-123 (2003) - Yoshio Ohtsubo:
Minimizing risk models in stochastic shortest path problems. Math. Methods Oper. Res. 57(1): 79-88 (2003) - Süleyman Özekici, Refik Soyer:
Bayesian analysis of Markov Modulated Bernoulli Processes. Math. Methods Oper. Res. 57(1): 125-140 (2003) - Gerard Sierksma, Gert A. Tijssen:
Degeneracy degrees of constraint collections. Math. Methods Oper. Res. 57(3): 437-448 (2003) - Lotfi Tadj, Jau-Chuan Ke:
Control policy of a hysteretic queueing system. Math. Methods Oper. Res. 57(3): 367-376 (2003) - Hui-Chin Tang:
Using an adaptive genetic algorithm with reversals to find good second-order multiple recursive random number generators. Math. Methods Oper. Res. 57(1): 41-48 (2003)
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 2025-01-18 12:58 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