Остановите войну!
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 25 matches
- 1999
- N. M. M. de Abreu, Tania Maia Querido, Paulo Oswaldo Boaventura Netto:
Redinv-SA: la simulated annealing for the quadratic assignment problem. RAIRO Oper. Res. 33(3): 249-273 (1999) - Jesus R. Artalejo, Antonio Gómez-Corral:
Computation of the limiting distribution in queueing systems with repeated attempts and disasters. RAIRO Oper. Res. 33(3): 371-382 (1999) - Evripidis Bampis:
The complexity of short schedules for uet bipartite graphs. RAIRO Oper. Res. 33(3): 367-370 (1999) - Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
On the parallel complexity of the alternating Hamiltonian cycle problem. RAIRO Oper. Res. 33(4): 421-437 (1999) - Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech:
Un couplage entre un algorithme génétique et un modèle de simulation pour l'ordonnancement à court terme d'un atelier discontinu de chimie fine. RAIRO Oper. Res. 33(3): 299-338 (1999) - Monique Becker, André-Luc Beylot, G. Damm, Wei-Ying Thang:
Automatic run-time choice for simulation length in mimesis. RAIRO Oper. Res. 33(1): 93-115 (1999) - Y. Bencheikh:
Classification croisée et modèles. RAIRO Oper. Res. 33(4): 525-541 (1999) - Farid Beninel:
Dissimilarites de type spherique et positionnement multidimensionnel normé. RAIRO Oper. Res. 33(4): 569-581 (1999) - Alain Bui, Marc Bui, Christian Lavault:
On the hierarchy of functioning rules in distributed computing. RAIRO Oper. Res. 33(1): 15-27 (1999) - Regina Sandra Burachik, Alfredo N. Iusem:
A generalized proximal point algorithm for the nonlinear complementarity problem. RAIRO Oper. Res. 33(4): 447-479 (1999) - Huan Neng Chiu:
A good approximation of the inventory level in a (Q, r) perishable inventory system. RAIRO Oper. Res. 33(1): 29-45 (1999) - Marc Demange, Vangelis Th. Paschos:
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO Oper. Res. 33(4): 481-507 (1999) - Mohamed Haouari, Thouraya Daouas:
Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Oper. Res. 33(4): 439-445 (1999) - Abdelkrim Haqiq, Noufissa Mikou:
Contrôle dynamique de flux dans un système d'attente avec panne. RAIRO Oper. Res. 33(1): 69-86 (1999) - Michael M. Kostreva, Wlodzimierz Ogryczak:
Linear optimization with multiple equitable criteria. RAIRO Oper. Res. 33(3): 275-297 (1999) - Israël-César Lerman:
Comparing classification tree structures: a special case of comparing q-ary relations. RAIRO Oper. Res. 33(3): 339-365 (1999) - Marie-Luce Levy, Pierre Lopez, Bernard Pradin:
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine. RAIRO Oper. Res. 33(2): 185-208 (1999) - Chi-Kwong Li, Wing-Keung Wong:
Extension of stochastic dominance theory to random variables. RAIRO Oper. Res. 33(4): 509-524 (1999) - Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. RAIRO Oper. Res. 33(1): 87-92 (1999) - Bertrand Munier, Nathalie Taverdet-Popiolek:
Choix multicritères dans le risque et variables multidimensionnelles: proposition de méthode et application aux réseaux de transport d'énergie. RAIRO Oper. Res. 33(4): 543-568 (1999) - Anass Nagih, Gérard Plateau:
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. RAIRO Oper. Res. 33(4): 383-419 (1999) - Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner:
On the application of insertion techniques for job shop problems with setup times. RAIRO Oper. Res. 33(2): 209-245 (1999) - Éric D. Taillard:
A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper. Res. 33(1): 1-14 (1999) - Philippe Vallin:
Détermination d'une période économique robuste dans le cadre du modèle de Wilson. RAIRO Oper. Res. 33(1): 47-67 (1999) - A. Vignier, Jean-Charles Billaut, Christian Proust:
Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art. RAIRO Oper. Res. 33(2): 117-183 (1999)
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-08-26 08:40 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