Остановите войну!
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 34 matches
- 2003
- Mohammed Abbad, Cherki Daoui:
Hierarchical algorithms for discounted and weighted Markov decision processes. Math. Methods Oper. Res. 58(2): 237-245 (2003) - Roberto Andreani, Cibele Dunder, José Mario Martínez:
Order-Value Optimization: Formulation and solution by means of a primal cauchy method. Math. Methods Oper. Res. 58(3): 387-399 (2003) - Luitpold Babel, Hans Kellerer:
Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Methods Oper. Res. 58(3): 359-374 (2003) - Jongho Bae, Jongwoo Kim, Eui Yong Lee:
An optimal service rate in a Poisson arrival queue with two-stage service policy. Math. Methods Oper. Res. 58(3): 477-482 (2003) - Sandjai Bhulai, Flora M. Spieksma:
On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions. Math. Methods Oper. Res. 58(2): 221-236 (2003) - Gido A. J. F. Brouns, Jan van der Wal:
Optimal threshold policies in a workload model with a variable number of service phases per job. Math. Methods Oper. Res. 58(3): 483-501 (2003) - Emilio Carrizosa, Stefan Nickel:
Robust facility location. Math. Methods Oper. Res. 58(2): 331-349 (2003) - Balbina Casas-Méndez, José Manuel Prada-Sánchez:
On the properties of solutions for NTU communication situations 1. Math. Methods Oper. Res. 58(3): 417-439 (2003) - Peter Chu, Patrick S. Chen, Thomas Niu:
Note on supplier-restricted order quantity under temporary price discounts. Math. Methods Oper. Res. 58(1): 141-147 (2003) - Yuanyao Ding, Rangcheng Jia, Shaoxiang Tang:
Dynamic principal agent model based on CMDP. Math. Methods Oper. Res. 58(1): 149-157 (2003) - Matthias Ehrgott:
Book Reviews. Math. Methods Oper. Res. 58(2): 351-358 (2003) - Sándor P. Fekete, Robert T. Firla, Bianca Spille:
Characterizing matchings as the intersection of matroids. Math. Methods Oper. Res. 58(2): 319-329 (2003) - János Flesch, Frank Thuijsman, O. J. Vrieze:
Stochastic games with non-observable actions. Math. Methods Oper. Res. 58(3): 459-475 (2003) - Kevin D. Glazebrook:
An analysis of Klimov's problem with parallel servers. Math. Methods Oper. Res. 58(1): 1-28 (2003) - Deren Han, Hong K. Lo:
A feasible descent algorithm for solving variational inequality problems. Math. Methods Oper. Res. 58(2): 259-269 (2003) - Yolanda Hinojosa, Justo Puerto:
Single facility location problems with unbounded unit balls. Math. Methods Oper. Res. 58(1): 87-104 (2003) - Yan-An Hwang:
Closedness under reduced games. Math. Methods Oper. Res. 58(3): 441-448 (2003) - Bienvenido Jiménez, Vicente Novo:
Second order necessary conditions in set constrained differentiable vector optimization. Math. Methods Oper. Res. 58(2): 299-317 (2003) - Jau-Chuan Ke:
Optimal strategy policy in batch arrival queue with server breakdowns and multiple vacations. Math. Methods Oper. Res. 58(1): 41-56 (2003) - Flip Klijn, Dries Vermeulen, Herbert Hamers, Tamás Solymosi, Stef Tijs, Joan Pere Villar:
Neighbor games and the leximax solution. Math. Methods Oper. Res. 58(2): 191-208 (2003) - Holger Kraft:
Elasticity approach to portfolio optimization. Math. Methods Oper. Res. 58(1): 159-182 (2003) - Thomas Krieger:
On Pareto equilibria in vector-valued extensive form games. Math. Methods Oper. Res. 58(3): 449-458 (2003) - Enrico Miglierina, Elena Molho:
Well-posedness and convexity in vector optimization. Math. Methods Oper. Res. 58(3): 375-385 (2003) - Yoshio Okamoto:
Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res. 58(1): 131-139 (2003) - Iosif Pinelis:
A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families. Math. Methods Oper. Res. 58(1): 105-129 (2003) - Miklós Rásonyi:
Equivalent martingale measures for large financial markets in discrete time. Math. Methods Oper. Res. 58(3): 401-415 (2003) - Maria Cristina Recchioni:
A path following method for box-constrained multiobjective optimization with applications to goal programming problems. Math. Methods Oper. Res. 58(1): 69-85 (2003) - Alexander Shapiro:
Inference of statistical bounds for multistage stochastic programming problems. Math. Methods Oper. Res. 58(1): 57-68 (2003) - Kuo-Hsiung Wang:
Optimal control of a removable and non-reliable server in an M/M/1 queueing system with exponential startup time. Math. Methods Oper. Res. 58(1): 29-39 (2003) - Xikui Wang, Mikelis G. Bickis:
One-armed bandit models with continuous and delayed responses. Math. Methods Oper. Res. 58(2): 209-219 (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 2024-06-14 15:18 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