AAAAAA
Results: 1-25/193
Authors:
T'kindt, V
Billaut, JC
Citation: V. T'Kindt et Jc. Billaut, Multicriteria scheduling problems: A survey, RAIRO RE OP, 35(2), 2001, pp. 143-163
Authors:
Chretienne, P
Citation: P. Chretienne, Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine, RAIRO RE OP, 35(2), 2001, pp. 165-187
Authors:
Boizumault, P
David, P
Djellab, H
Citation: P. Boizumault et al., Resource allocation in a mobile telephone network: A constructive repair algorithm, RAIRO RE OP, 35(2), 2001, pp. 189-209
Authors:
Meurdesoif, P
Rottembourg, B
Citation: P. Meurdesoif et B. Rottembourg, Semi-definite positive programming relaxations for graph K-n-coloring in frequency assignment, RAIRO RE OP, 35(2), 2001, pp. 211-228
Authors:
Jungblut-Hessel, R
Plateau, B
Stewart, WJ
Ycart, B
Citation: R. Jungblut-hessel et al., Fast simulation for road traffic network, RAIRO RE OP, 35(2), 2001, pp. 229-250
Authors:
Hanafi, S
Freville, A
Citation: S. Hanafi et A. Freville, Extension of Reverse Elimination Method through a dynamic management of the tabu list, RAIRO RE OP, 35(2), 2001, pp. 251-267
Authors:
Mahey, P
Phong, TQ
Luna, HPL
Citation: P. Mahey et al., Separable convexification and DCA techniques for capacity and flow assignment problems, RAIRO RE OP, 35(2), 2001, pp. 269-281
Authors:
Guenoche, A
Leclerc, B
Citation: A. Guenoche et B. Leclerc, The triangles method to build X-trees from incomplete distance matrices, RAIRO RE OP, 35(2), 2001, pp. 283-300
Authors:
Maurras, JF
Finke, G
Tolla, P
Citation: Jf. Maurras et al., ROADEF'99 - Preface, RAIRO RE OP, 35(2), 2001, pp. V-VI
Authors:
Burkard, RE
Klinz, B
Zhang, JZ
Citation: Re. Burkard et al., Bottleneck capacity expansion problems with general budget constraints, RAIRO RE OP, 35(1), 2001, pp. 1-20
Authors:
Dohi, T
Othman, FS
Kaio, N
Osaki, S
Citation: T. Dohi et al., The Lorenz transform approach to the optimal repair-cost limit replacementpolicy with imperfect repair, RAIRO RE OP, 35(1), 2001, pp. 21-36
Authors:
Roundy, RO
Samorodnitsky, G
Citation: Ro. Roundy et G. Samorodnitsky, Optimal and near-optimal (s, S) inventory policies for levy demand processes, RAIRO RE OP, 35(1), 2001, pp. 37-70
Authors:
Gordon, VS
Werner, F
Yanushkevich, OA
Citation: Vs. Gordon et al., Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals, RAIRO RE OP, 35(1), 2001, pp. 71-83
Authors:
Maublanc, J
Peyrton, D
Quilliot, A
Citation: J. Maublanc et al., Multiple routing strategies in a labelled network, RAIRO RE OP, 35(1), 2001, pp. 85-106
Authors:
Baptiste, P
Jouglet, A
Citation: P. Baptiste et A. Jouglet, On minimizing total tardiness in a serial batching problem, RAIRO RE OP, 35(1), 2001, pp. 107-115
Authors:
Yang, XG
Citation: Xg. Yang, Complexity of partial inverse assignment problem and partial inverse cut problem, RAIRO RE OP, 35(1), 2001, pp. 117-126
Authors:
Kratica, J
Tosic, D
Filipovic, V
Ljubic, I
Citation: J. Kratica et al., Solving the simple plant location problem by genetic algorithm, RAIRO RE OP, 35(1), 2001, pp. 127-142
Authors:
Nasroallah, A
Citation: A. Nasroallah, Simulation of transient performance measures for stiff Markov chains, RAIRO RE OP, 34(4), 2000, pp. 385-396
Authors:
Stancu-Minasian, IM
Tigan, S
Citation: Im. Stancu-minasian et S. Tigan, Continuous time linear-fractional programming. The minimum-risk approach, RAIRO RE OP, 34(4), 2000, pp. 397-409
Authors:
Bigi, G
Castellani, M
Citation: G. Bigi et M. Castellani, Second order optimality conditions for differentiable multiobjective problems, RAIRO RE OP, 34(4), 2000, pp. 411-426
Authors:
Fourneau, JM
Verchere, D
Citation: Jm. Fourneau et D. Verchere, G-networks in a random environment, RAIRO RE OP, 34(4), 2000, pp. 427-448
Authors:
Rebai, A
Martel, JM
Citation: A. Rebai et Jm. Martel, BBTOPSIS rankings based on intervals of relative proximities with preference qualification, RAIRO RE OP, 34(4), 2000, pp. 449-465
Authors:
Tayachi, D
Chretienne, P
Mellouli, K
Citation: D. Tayachi et al., A tabu method for multiprocessor scheduling with communication delays, RAIRO RE OP, 34(4), 2000, pp. 467-485
Authors:
Lerman, IC
Rouxel, F
Citation: Ic. Lerman et F. Rouxel, Comparing classification tree structures: A special case of comparing q-ary relations II, RAIRO RE OP, 34(3), 2000, pp. 251-281
Authors:
Humes, C
Silva, PJDE
Citation: C. Humes et Pjde. Silva, Strict convex regularizations, proximal points and augmented Lagrangians, RAIRO RE OP, 34(3), 2000, pp. 283-303