@article{RO_1982__16_3_263_0, author = {Beghin-Picavet, M. and Hansen, P.}, title = {Deux probl\`emes d'affectation non lin\'eaires}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {263--276}, publisher = {EDP-Sciences}, volume = {16}, number = {3}, year = {1982}, zbl = {0491.90082}, language = {fr}, url = {http://archive.numdam.org/item/RO_1982__16_3_263_0/} }
TY - JOUR AU - Beghin-Picavet, M. AU - Hansen, P. TI - Deux problèmes d'affectation non linéaires JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1982 SP - 263 EP - 276 VL - 16 IS - 3 PB - EDP-Sciences UR - http://archive.numdam.org/item/RO_1982__16_3_263_0/ LA - fr ID - RO_1982__16_3_263_0 ER -
Beghin-Picavet, M.; Hansen, P. Deux problèmes d'affectation non linéaires. RAIRO - Operations Research - Recherche Opérationnelle, Tome 16 (1982) no. 3, pp. 263-276. http://archive.numdam.org/item/RO_1982__16_3_263_0/
1. Optimal Linear Ordering, S.I.A.M. J. on Applied Math., vol. 25, 1973, p. 403-423. | MR | Zbl
et ,2. Introduction to Sequencing and Scheduling, New York, Wiley, 1974.
,3. Dynamic Programming, Princeton, Princeton University Press, 1957. | MR | Zbl
,4. Assignment and Matching Problems : Solution Methods with Fortran-Programs, vol. 184, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Heidelberg, New York. | MR | Zbl
et ,5. Computers and Intractability, A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979. | MR | Zbl
et ,6. Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, vol. 1, 1976, p. 237-267. | MR | Zbl
, et ,7. Finite-State Processes and Dynamic Programming, S.I.A.M. J. on Applied Math., vol. 15, 1967, p. 693-718. | MR | Zbl
et ,8. One Dimensional Space Allocation : An Ordering Algorithm, Operations Research, vol. 17, 1969, p. 812-826. | MR | Zbl
,9. A Further Note on One-Dimensional Space Allocations, Operations Research, vol. 19, 1971, p. 249.
,