no. 1
Placement de tâches dans un système distribué et dualité lagrangienne
RAIRO - Operations Research - Recherche Opérationnelle, Tome 26 (1992) no. 1, pp. 83-97. 
@article{RO_1992__26_1_83_0,
     author = {Billionnet, A. and Elloumi, S.},
     title = {Placement de t\^aches dans un syst\`eme distribu\'e et dualit\'e lagrangienne},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {83--97},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {1},
     year = {1992},
     mrnumber = {1162705},
     zbl = {0749.68006},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1992__26_1_83_0/}
}
TY  - JOUR
AU  - Billionnet, A.
AU  - Elloumi, S.
TI  - Placement de tâches dans un système distribué et dualité lagrangienne
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1992
SP  - 83
EP  - 97
VL  - 26
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1992__26_1_83_0/
LA  - fr
ID  - RO_1992__26_1_83_0
ER  - 
%0 Journal Article
%A Billionnet, A.
%A Elloumi, S.
%T Placement de tâches dans un système distribué et dualité lagrangienne
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1992
%P 83-97
%V 26
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1992__26_1_83_0/
%G fr
%F RO_1992__26_1_83_0
Billionnet, A.; Elloumi, S. Placement de tâches dans un système distribué et dualité lagrangienne. RAIRO - Operations Research - Recherche Opérationnelle, Tome 26 (1992) no. 1, pp. 83-97. http://archive.numdam.org/item/RO_1992__26_1_83_0/

[ADA,90] W. P. Adams, A. Billionnet et A. Sutter, Unconstrained 0-1 Optimisation and Lagrangean Relaxation, Discrete Appl. Math., Discrete Appl. Math., 1990, 29, nos 2-3, p. 131-142. | MR | Zbl

[AND,88] F. André et J. L. Pazat, Le placement de tâches sur les architectures parallèles. Tech. Sci. Inform., 1988, 7, n° 4, p. 385-401. | Zbl

[BEN,89] D. Benhamamouch, Résolution approchée d'un problème d'affectation de tâches dans les systèmes informatiques distribués, Thèse de doctorat, Université d'Oran Es Senia, 1989.

[BIL,85] A. Billionnet et M. Minoux, Maximizing a Supermodular Pseudoboolean Function: a Polynomial Algorithm for Supermodular Cubic Functions, Discrete Appl. Math., 1985, 12, p. 1-11. | MR | Zbl

[BIL,88] A. Billionnet, M. C. Costa et A. Sutter, An efficient Algorithm for a Task Allocation Problem, A.C.M. (à paraître). | Zbl

[BIL,89] A. Billionnet, M. C. Costa et A. Sutter, Les problèmes de placement dans les systèmes distribués, Tech. Sci. Inform., 1989, 8, n° 4, p. 307-337.

[BOK,81] S. Bokhari, A Shortest Tree Algorithm for Optimal Assignments across Space and Time in a Distributed Processor SystemI.E.E.E. Trans. Software Engrg., Nov. 1981, SE-7, n° 6, p. 583-589.

[BOK,87] S. Bokhari, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishers, Norwell, Massachusets, USA, 1987, 155 p.

[BOU,86] P. M. Bourjolly, Integral and Fractional Node-Pakings, and Pseudoboolean Programming, Thesis for the degree of Doctor of Philosophy in Combinatorics and Optimization, Université de Waterloo, Ontario, Canada, 1986.Thesis for the degree of Doctor of Philosophy in Combinatorics and Optimization, Université de Waterloo, Ontario, Canada, 1986.

[EFE,82] K. Efe, Heuristic Models for Task Assignment Scheduling in Distributed Systems Computer, juin 1982, 15, p. 50-56.

[FER,89] D. Fernandez-Baca, Allocating Modules to Processors in a Distributed System, I.E.E.E. Trans. Software Engrg., 1989, SE-15, n° 11, p. 1427-1436.

[GAB,84] A. Gabrielian et D. B. Tyler, Optimal Object Allocation in Distributed Systems, Proc. of the Int. Conf. on Distributed Computing Systems, San Francisco, California 14-18 May 1984, p. 88-95.

[GON,85] M. Gondram et M. Minoux, Graphes et algorithmes, Eyrolles, Paris, 1985, 524 p. | MR | Zbl

[HAM,84] P. L. Hammer, P. Hansen et B. Simeone, Roof Duality, Complementation and Persistency in Quadratic 0-1 Optimization, Math. Programming, 1984, 28, p, 121-155. | MR | Zbl

[LO,84] V. M. Lo, Heuristic Algorithms for Task Assignment in Distributed Systems, Proc. of the int. Conf. on Distributed Computing Systems, San Francisco, California 14-18 May 1984, p. 30-39.

[LU,84] M. I. Lu et J. B. Sinclair, Module Assignment in Distributed Systems, Proc. 1984 Computer Network Symposium, Gathersburg, MD, p. 105-111.

[MA,82] P. R. Ma, E. Y. S. Lee et M. Tsuchiya, A Task Allocation Model for Distributed Computing Systems, I.E.E.E. Trans. Comput., Jan. 1982, C-31, n° 1, p. 66-78.

[MAG,89] V. F. Magirou et J. Z. Milis, An algorithm for the multiprocessor assignment problem. Oper. Res. Lett., 1989, 8, p. 351-356. | MR | Zbl

[PRI,84] C. C. Price et S. Krishnaprasad, Software Allocation Models for Distributed Computing Systems, Proc. of the Int. Conf. on Distributed Computing Systems, San Francisco, California, 14-18 May 1984, p. 40-48.

[RAO,79] G. S. Rao, H. S. Stone et T. C. Hu, Assignment of Tasks in a Distributed Processor System with Limited Memory, I.E.E.E. Trans. Comput., April 1979, C-28, n° 4, p. 291-299. | MR | Zbl

[RHY,70] J. Rhys, A Selection Problem of Shared Fixed Costs and Networks, Management Sci., 1970, 17, p. 200-207. | MR | Zbl

[SIN,87] J. B. Sinclair, Efficient Computation of Optimal Assignments for Distributed Tasks, J. Parallel Dist. Comput., 1987, 4, p. 342-362.

[SUT,89] A. Sutter, Programmation non linéaire en variables 0-1, Application à des problèmes de placement de tâches dans un système distribué, Thèse de doctorat du C.N.A.M., juin 1989.

[TOW,86] D. Towsley, Allocating Programs Containing Branches and Loops within a Multiple Processor System, I.E.E.E. Trans. Software Engrg., 1986, SE-12, n° 10, p. 1018-1024. | Zbl