External Links

    Journal: RAIRO - Operations Research

    Volume 36, Issue 4

    279 -- 297Jérôme Monnot. Differential approximation of NP-hard problems with equal size feasible solutions
    299 -- 310Natalia V. Djellab. On the M/G/1 retrial queue subjected to breakdowns
    311 -- 350Marc Demange, Vangelis Th. Paschos. Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
    351 -- 364Moncef Abbas, Djamal Chaabane. An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
    365 -- 373Ali Derbala. Un ordonnancement dynamique de tâches stochastiques sur un seul processeur

    Volume 36, Issue 3

    175 -- 190Teodros Getachew, Michael M. Kostreva. A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
    191 -- 208Abdelkrim Haqiq, Ioannis Lambadaris, Noufissa Mikou, Luis Orozco-Barbosa. Optimal QoS control of interacting service stations
    209 -- 226Giandomenico Mastroeni. A Markov chain model for traffic equilibrium problems
    227 -- 235Cunhua Qian, Yu Pan, Toshio Nakagawa. Optimal Policies for a Database System with Two Backup Schemes
    237 -- 277Marc Demange, Vangelis Th. Paschos. Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

    Volume 36, Issue 2

    109 -- 127Igor Bykadorov, Andrea Ellero, Elena Moretti. Minimization of communication expenditure for seasonal products
    129 -- 148Hiroyuki Okamura, Satoshi Miyahara, Tadashi Dohi. Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
    149 -- 156Jacek Blazewicz, Piotr Formanowicz. Scheduling jobs in open shops with limited machine availability
    157 -- 172Hiroaki Sandoh, Roy Larke. A Theoretical Model for Testing New Product Sales Velocity at Small Format Retail Stores
    173 -- 0Franco Giannessi. Technical comment. A problem on Markov chains

    Volume 36, Issue 1

    1 -- 19T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández. The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
    21 -- 36Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
    37 -- 51Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski. Scheduling multiprocessor tasks on two parallel processors
    53 -- 71Sofia Kovaleva, Frits C. R. Spieksma. Primal-dual approximation algorithms for a packing-covering pair of problems
    73 -- 94Ahmed Roubi. Convergence of Prox-Regularization Methods for Generalized Fractional Programming
    95 -- 100Fethi Kadhi. Generalized Characterization of the Convex Envelope of a Function
    101 -- 108Michel Petitjean. Agrégation des similarités : une solution oubliée
    runs on