Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Operations Research, Volume 34
Volume 34, Number 1, January 2000
- Jacques Carlier, Emmanuel Néron:
An Exact Method for Solving the Multi-Processor Flow-Shop. 1-25 - Teodros Getachew, Michael M. Kostreva, Laura C. Lancaster:
A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks. 27-47 - Serge Dubuc, Issa Kagabo, Patrice Marcotte:
Trivial Cases for the Kantorovitch Problem. 49-59 - Alain Hertz, Vincent Robert, Vincent Berthod:
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise. 61-83 - Bruno Tuffin, Louis-Marie Le Ny:
Parallélisation d'une Combinaison des Méthodes de Monte-Carlo et Quasi-Monte-Carlo et Application aux Réseaux de Files d'Attente. 85-98 - Maryse Béguin:
Transfert de Charge dans un Réseau de Processeurs Totalement Connectés. 99-129
Volume 34, Number 2, April 2000
- Frédéric Guinand
, Denis Trystram:
Scheduling UET Trees with Communication Delays on two Processors. 131-144 - Bermawi P. Iskandar, Hiroaki Sandoh:
An Extended Opportunity-Based Age Replacement Policy. 145-154 - Maria Cruz López de los Mozos Martin, Juan A. Mesa:
The Variance Location Problem on a Network with Continuously distributed demand. 155-182 - Abdellah Salhi, Les G. Proll, David Ríos Insua, J. I. Martin:
Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems. 183-197 - Thierry Foucart:
Colinearité et Instabilité Numérique dans le Modèle Linéaire. 199-212 - Emmanuel Besson:
Modèles Analytiques de Routeurs. 213-236 - M. Ioualalen, Amar Aïssani:
Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique. 237-249
Volume 34, Number 3, July 2000
- Israël-César Lerman, F. Rouxel:
Comparing classification tree structures: A special case of comparing q-ary relations II. 251-281 - Carlos Humes Jr., Paulo José da Silva e Silva:
Strict convex regularizations, proximal points and augmented lagrangians. 283-303 - Pascal Richard:
Modelling integer linear programs with petri nets. 305-312 - Kazutomo Nishizawa:
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). 313-330 - L. Mauricio Graña Drummond, Alfredo Noel Iusem, Benar Fux Svaiter:
On the central path for nonlinear semidefinite programming. 331-345 - Dominique Lepelley, Laurent Vidu:
Regles positionnelles iteratives, principe majoritaire et preferences unimodales. 347-362 - Nicolas Preux, Fatiha Bendali, Jean Mailfert, Alain Quilliot:
Coeur et nucléolus des jeux de recouvrement. 363-383
Volume 34, Number 4, October 2000
- Abdelaziz Nasroallah:
Simulation of transient performance measures for stiff markov chains. 385-396 - Ioan M. Stancu-Minasian, Stefan Tigan:
Continuous time linear-fractional programming. The minimum-risk approach. 397-409 - Giancarlo Bigi, Marco Castellani:
Second order optimality conditions for differentiable multiobjective problems. 411-426 - Jean-Michel Fourneau, Dominique Verchère:
G-Réseaux dans un environnement aléatoire. 427-448 - Abdelwaheb Rebaï, Jean-Marc Martel:
Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences. 449-465 - Dalila Tayachi, Philippe Chrétienne, Khaled Mellouli:
Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication. 467-485
a service of 
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.
last updated on 2024-04-25 04:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
