Остановите войну!
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
- 2004
- Mohammed Abbad, Khalid Rahhali:
Semi-infinite weighted Markov decision processes with perturbation. Math. Methods Oper. Res. 60(2): 251-265 (2004) - Rafael Amer, José Miguel Giménez:
A connectivity game for graphs. Math. Methods Oper. Res. 60(3): 453-470 (2004) - Edward J. Anderson, Huifu Xu:
Nash equilibria in electricity markets with discrete prices. Math. Methods Oper. Res. 60(2): 215-238 (2004) - Miguel F. Anjos:
On semidefinite programming relaxations for the satisfiability problem. Math. Methods Oper. Res. 60(3): 349-367 (2004) - Lukasz Balbus, Andrzej S. Nowak:
Construction of Nash equilibria in symmetric stochastic games of capital accumulation. Math. Methods Oper. Res. 60(2): 267-277 (2004) - Philippe Baptiste, Vadim G. Timkovsky:
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Math. Methods Oper. Res. 60(1): 145-153 (2004) - Oded Berman, Eungab Kim:
Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time. Math. Methods Oper. Res. 60(3): 497-521 (2004) - Walter Briec, Philippe Gardères:
Generalized benefit functions and measurement of utility. Math. Methods Oper. Res. 60(1): 101-123 (2004) - Rolando Cavazos-Cadena, Daniel Hernández-Hernández:
A characterization of exponential functionals in finite Markov chains. Math. Methods Oper. Res. 60(3): 399-414 (2004) - Hyeong Soo Chang:
Multi-policy iteration with a distributed voting. Math. Methods Oper. Res. 60(2): 299-310 (2004) - Chun-Tao Chang, Jinn-Tsair Teng:
Retailer's optimal ordering policy under supplier credits. Math. Methods Oper. Res. 60(3): 471-483 (2004) - Ruslan K. Chornei, Hans Daduna, Pavel S. Knopov:
Stochastic games for distributed players on graphs. Math. Methods Oper. Res. 60(2): 279-298 (2004) - Daniel Cruz-Suárez, Raúl Montes-de-Oca, Francisco Salem-Silva:
Conditions for the uniqueness of optimal policies of discounted Markov decision processes. Math. Methods Oper. Res. 60(3): 415-436 (2004) - Darinka Dentcheva, Bogumila Lai, Andrzej Ruszczynski:
Dual methods for probabilistic optimization problems *. Math. Methods Oper. Res. 60(2): 331-346 (2004) - Ya-Ping Fang, Nan-Jing Huang:
On least element problems for feasible sets in vector complementarity problems. Math. Methods Oper. Res. 60(3): 369-377 (2004) - Sándor P. Fekete, Jörg Schepers:
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems. Math. Methods Oper. Res. 60(2): 311-329 (2004) - Stanislaw Gawiejnowicz:
Book Review. Math. Methods Oper. Res. 60(3): 523-524 (2004) - Wenjing Guo, Chengming Xu:
Optimal portfolio selection when stock prices follow an jump-diffusion process. Math. Methods Oper. Res. 60(3): 485-496 (2004) - Holger Höller:
Book Review. Math. Methods Oper. Res. 60(3): 525-526 (2004) - Igor V. Konnov:
Dual approach for a class of implicit convex optimization problems. Math. Methods Oper. Res. 60(1): 87-99 (2004) - Ralf Korn:
Realism and practicality of transaction cost approaches in continuous-time portfolio optimisation: the scope of the Morton-Pliska approach. Math. Methods Oper. Res. 60(2): 165-174 (2004) - Nguyen Thanh Long:
Investment optimization under constraints. Math. Methods Oper. Res. 60(2): 175-201 (2004) - Hsing Paul Luh, Kai-Hung Tseng:
Characterizing the idle time of a nonexponential server system. Math. Methods Oper. Res. 60(3): 379-397 (2004) - Steven Nahmias, David Perry, Wolfgang Stadje:
Perishable inventory systems with variable input and demand rates. Math. Methods Oper. Res. 60(1): 155-162 (2004) - Luka Neralic, Oliver Stein:
On regular and parametric data envelopment analysis. Math. Methods Oper. Res. 60(1): 15-28 (2004) - Yoshio Ohtsubo, Kenji Toyonaga:
Equivalence classes for optimizing risk models in Markov decision processes. Math. Methods Oper. Res. 60(2): 239-250 (2004) - Alexei B. Piunovskiy:
Multicriteria impulsive control of jump Markov processes. Math. Methods Oper. Res. 60(1): 125-144 (2004) - Seyed Jafar Sadjadi, Mir-Bahador Aryanezhad, Babak Farhang Moghaddam:
A dynamic programming approach to solve efficient frontier. Math. Methods Oper. Res. 60(2): 203-214 (2004) - Minoru Sakaguchi, Vladimir V. Mazalov:
A non-zero-sum no-information best-choice game. Math. Methods Oper. Res. 60(3): 437-451 (2004) - Mikael Signahl:
Sensitivity analysis via simulation in the presence of discontinuities. Math. Methods Oper. Res. 60(1): 29-51 (2004)
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-04-28 01:03 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