![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 22 matches
- 2002
- Moncef Abbas, Djamal Chaabane:
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem. RAIRO Oper. Res. 36(4): 351-364 (2002) - Evripidis Bampis
, Rodolphe Giroudeau, Jean-Claude König:
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. 36(1): 21-36 (2002) - Jacek Blazewicz
, Paolo Dell'Olmo, Maciej Drozdowski
:
Scheduling multiprocessor tasks on two parallel processors. RAIRO Oper. Res. 36(1): 37-51 (2002) - Jacek Blazewicz
, Piotr Formanowicz:
Scheduling jobs in open shops with limited machine availability. RAIRO Oper. Res. 36(2): 149-156 (2002) - T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández
:
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets. RAIRO Oper. Res. 36(1): 1-19 (2002) - Igor A. Bykadorov
, Andrea Ellero
, Elena Moretti:
Minimization of communication expenditure for seasonal products. RAIRO Oper. Res. 36(2): 109-127 (2002) - Marc Demange, Vangelis Th. Paschos:
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. RAIRO Oper. Res. 36(3): 237-277 (2002) - Marc Demange, Vangelis Th. Paschos:
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. RAIRO Oper. Res. 36(4): 311-350 (2002) - Ali Derbala:
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur. RAIRO Oper. Res. 36(4): 365-373 (2002) - Natalia V. Djellab:
On the M/G/1 retrial queue subjected to breakdowns. RAIRO Oper. Res. 36(4): 299-310 (2002) - Teodros Getachew, Michael M. Kostreva:
A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set. RAIRO Oper. Res. 36(3): 175-190 (2002) - Franco Giannessi:
Technical comment. A problem on Markov chains. RAIRO Oper. Res. 36(2): 173 (2002) - Abdelkrim Haqiq
, Ioannis Lambadaris, Noufissa Mikou, Luis Orozco-Barbosa
:
Optimal QoS control of interacting service stations. RAIRO Oper. Res. 36(3): 191-208 (2002) - Fethi Kadhi
:
Generalized Characterization of the Convex Envelope of a Function. RAIRO Oper. Res. 36(1): 95-100 (2002) - Sofia Kovaleva, Frits C. R. Spieksma
:
Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO Oper. Res. 36(1): 53-71 (2002) - Giandomenico Mastroeni
:
A Markov chain model for traffic equilibrium problems. RAIRO Oper. Res. 36(3): 209-226 (2002) - Jérôme Monnot:
Differential approximation of NP-hard problems with equal size feasible solutions. RAIRO Oper. Res. 36(4): 279-297 (2002) - Hiroyuki Okamura
, Satoshi Miyahara, Tadashi Dohi
:
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation. RAIRO Oper. Res. 36(2): 129-148 (2002) - Michel Petitjean
:
Agrégation des similarités : une solution oubliée. RAIRO Oper. Res. 36(1): 101-108 (2002) - Cunhua Qian, Yu Pan, Toshio Nakagawa:
Optimal Policies for a Database System with Two Backup Schemes. RAIRO Oper. Res. 36(3): 227-235 (2002) - Ahmed Roubi:
Convergence of Prox-Regularization Methods for Generalized Fractional Programming. RAIRO Oper. Res. 36(1): 73-94 (2002) - Hiroaki Sandoh
, Roy Larke
:
A Theoretical Model for Testing New Product Sales Velocity at Small Format Retail Stores. RAIRO Oper. Res. 36(2): 157-172 (2002)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-10 01:33 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