Остановите войну!
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 29 matches
- 2000
- Philippe Baptiste:
Batching identical jobs. Math. Methods Oper. Res. 52(3): 355-367 (2000) - Victor J. Baston, Andrej Yu. Garnaev:
On a game in manufacturing. Math. Methods Oper. Res. 52(2): 237-249 (2000) - Michael J. Best, Jaroslava Hlouskova:
The efficient frontier for bounded assets. Math. Methods Oper. Res. 52(2): 195-212 (2000) - Onno J. Boxma, Qing Deng:
Asymptotic behaviour of the tandem queueing system with identical service times at both queues. Math. Methods Oper. Res. 52(2): 307-323 (2000) - Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder:
Scheduling UET task systems with concurrency on two parallel identical processors. Math. Methods Oper. Res. 52(3): 369-387 (2000) - Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces. Math. Methods Oper. Res. 52(1): 133-167 (2000) - Ulrich Dorndorf, Erwin Pesch, Toàn Phan Huy:
A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math. Methods Oper. Res. 52(3): 413-439 (2000) - Encarnación Algaba Durán, Jesús Mario Bilbao, Peter Borm, J. J. López:
The position value for union stable systems. Math. Methods Oper. Res. 52(2): 221-236 (2000) - Horst A. Eiselt, Carl-Louis Sandblom:
The bounce algorithm for mathematical programming. Math. Methods Oper. Res. 52(2): 173-183 (2000) - Wolfgang Espelage, Egon Wanke:
The combinatorial complexity of masterkeying. Math. Methods Oper. Res. 52(2): 325-348 (2000) - Ulrich Faigle, Walter Kern, Daniël Paulusma:
Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. 52(1): 23-38 (2000) - Vito Fragnelli, Ignacio García-Jurado, Luciano Méndez-Naya:
On shortest path games. Math. Methods Oper. Res. 52(2): 251-264 (2000) - Jun-Yi Fu:
Generalized vector quasi-equilibrium problems. Math. Methods Oper. Res. 52(1): 57-64 (2000) - Xianping Guo, Peng Shi, Weiping Zhu:
A new strong optimality criterion for nonstationary Markov decision processes. Math. Methods Oper. Res. 52(2): 287-306 (2000) - Bernd Heidergott:
Analysing sojourn times in queueing networks: A structural approach. Math. Methods Oper. Res. 52(1): 115-132 (2000) - Onésimo Hernández-Lerma, Juan González-Hernández:
Constrained Markov control processes in Borel spaces: the discounted case. Math. Methods Oper. Res. 52(2): 271-285 (2000) - X. X. Huang:
Stability in vector-valued and set-valued optimization. Math. Methods Oper. Res. 52(2): 185-193 (2000) - Rangcheng Jia, Yuanyao Ding:
Nonzero-sum non-stationary discounted Markov game model. Math. Methods Oper. Res. 52(2): 265-270 (2000) - Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Solving the discrete-continuous project scheduling problem via its discretization. Math. Methods Oper. Res. 52(3): 489-499 (2000) - Robert Klein, Armin Scholl:
PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem. Math. Methods Oper. Res. 52(3): 467-488 (2000) - Rolf H. Möhring, Frederik Stork:
Linear preselective policies for stochastic project scheduling. Math. Methods Oper. Res. 52(3): 501-515 (2000) - Aziz Moukrim:
Upper bound on the number of processors for scheduling with interprocessor communication delays. Math. Methods Oper. Res. 52(1): 99-113 (2000) - Klaus Neumann, Hartwig Nübel, Christoph Schwindt:
Active and stable project scheduling. Math. Methods Oper. Res. 52(3): 441-465 (2000) - Manfred Padberg:
Packing small boxes into a big box. Math. Methods Oper. Res. 52(1): 1-21 (2000) - Sonja Peterson:
General batch service disciplines - A product-form batch processing network with customer coalescence. Math. Methods Oper. Res. 52(1): 79-97 (2000) - Christian Prins:
Competitive genetic algorithms for the open-shop scheduling problem. Math. Methods Oper. Res. 52(3): 389-411 (2000) - Marco Slikker, Anne van den Nouweland:
Communication situations with asymmetric players. Math. Methods Oper. Res. 52(1): 39-56 (2000) - Charles S. Tapiero, Assa Birati:
Pension funds insurance individuation. Math. Methods Oper. Res. 52(2): 213-220 (2000) - Mark Voorneveld, Sofia Grahn, Martin Dufwenberg:
Ideal equilibria in noncooperative multicriteria games. Math. Methods Oper. Res. 52(1): 65-77 (2000)
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-05-06 02: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