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