External Links

    Journal: RAIRO - Operations Research

    Volume 35, Issue 4

    383 -- 394Marcia Fampa, Nelson Maculan. A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
    395 -- 399Djamel Benterki, Bachir Merikhi. A modified algorithm for the strict feasibility problem
    401 -- 414Philippe Michelon, Stéphanie Ripeau, Nelson Maculan. Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
    415 -- 438Michel Vasquez, Jin-Kao Hao. Une approche hybride pour le sac à dos multidimensionnel en variables 0-1
    439 -- 451Moussa Larbani, Rabia Nessah. Sur l'équilibre fort selon Berge

    Volume 35, Issue 3

    301 -- 313Jacques A. Ferland, Pina Marziliano. Efficient and Local Efficient Solutions for Assignment Type Problems
    315 -- 328Emilio Carrizosa, Eduardo Conde, A. Castaño, Dolores Romero Morales. Finding the principal points of a random variable
    329 -- 365Gérard Berthiau, Patrick Siarry. État de l'art des méthodes "d'optimisation globale"
    367 -- 381Fatiha Bendali, Jean Mailfert, Alain Quilliot. Tarification par des jeux Coopératifs avec Demandes Élastiques

    Volume 35, Issue 2

    143 -- 163Vincent T'Kindt, Jean-Charles Billaut. Multicriteria scheduling problems: a survey
    165 -- 187Philippe Chrétienne. Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine
    189 -- 209Patrice Boizumault, Philippe David, Housni Djellab. Resource allocation in a mobile telephone network: A constructive repair algorithm
    211 -- 228Philippe Meurdesoif, Benoît Rottembourg. n-Coloring in Frequency Assignment
    229 -- 250Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart. Fast simulation for Road Traffic Network
    251 -- 267Saïd Hanafi, Arnaud Fréville. Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
    269 -- 281P. Mahey, Thai Q. Phong, Henrique Pacca Loureiro Luna. Separable convexification and DCA techniques for capacity and flow assignment problems
    283 -- 300Alain Guénoche, Bruno Leclerc. X-trees from incomplete distance matrices

    Volume 35, Issue 1

    1 -- 20Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang 0001. Bottleneck Capacity Expansion Problems with General Budget Constraints
    21 -- 36Tadashi Dohi, F. S. Othman, Naoto Kaio, Shunji Osaki. The Lorenz Transform approach to the Optimal Repair-Cost limit remplacement Policy with Imperfect Repair
    37 -- 70Robin O. Roundy, Gennady Samorodnitsky. s, S) Inventory Policies for Levy Demand Processes
    71 -- 83Valery S. Gordon, Frank Werner, O. A. Yanushkevich. Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
    85 -- 106J. Maublanc, D. Peyrton, A. Quilliot. Multiple Routing Strategies in a Labelled Network
    107 -- 115Philippe Baptiste, Antoine Jouglet. On Minimizing Total Tardiness in a Serial Batching Problem
    117 -- 126Xiaoguang Yang. Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
    127 -- 142Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic. Solving the simple plant location problem by genetic algorithm
    runs on