Deux problèmes d'affectation non linéaires

M. Beghin-Picavet; P. Hansen

RAIRO - Operations Research - Recherche Opérationnelle (1982)

  • Volume: 16, Issue: 3, page 263-276
  • ISSN: 0399-0559

How to cite

top

Beghin-Picavet, M., and Hansen, P.. "Deux problèmes d'affectation non linéaires." RAIRO - Operations Research - Recherche Opérationnelle 16.3 (1982): 263-276. <http://eudml.org/doc/104813>.

@article{Beghin1982,
author = {Beghin-Picavet, M., Hansen, P.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {optimal assignment; quadratic assignment problem; computational experience; algorithm; optimal solution; NP-completeness; assignment of rooms to departments; minimization of travel distance; cubic assignment problem},
language = {fre},
number = {3},
pages = {263-276},
publisher = {EDP-Sciences},
title = {Deux problèmes d'affectation non linéaires},
url = {http://eudml.org/doc/104813},
volume = {16},
year = {1982},
}

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
PB - EDP-Sciences
VL - 16
IS - 3
SP - 263
EP - 276
LA - fre
KW - optimal assignment; quadratic assignment problem; computational experience; algorithm; optimal solution; NP-completeness; assignment of rooms to departments; minimization of travel distance; cubic assignment problem
UR - http://eudml.org/doc/104813
ER -

References

top
  1. 1. D. ADOLPHSON et T. C. HU, Optimal Linear Ordering, S.I.A.M. J. on Applied Math., vol. 25, 1973, p. 403-423. Zbl0274.90061MR345618
  2. 2. K. R. BAKER, Introduction to Sequencing and Scheduling, New York, Wiley, 1974. 
  3. 3. R. BELLMAN, Dynamic Programming, Princeton, Princeton University Press, 1957. Zbl1205.90002MR90477
  4. 4. R.E. BURKARD et U. DERIGS, Assignment and Matching Problems : Solution Methods with Fortran-Programs, vol. 184, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Heidelberg, New York. Zbl0436.90069MR610241
  5. 5. M. GAREY et D. S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979. Zbl0411.68039MR519066
  6. 6. M. GAREY, D. S. JOHNSON et L. STOCKMEYER, Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, vol. 1, 1976, p. 237-267. Zbl0338.05120MR411240
  7. 7. M. HELD et R. M. KARP, Finite-State Processes and Dynamic Programming, S.I.A.M. J. on Applied Math., vol. 15, 1967, p. 693-718. Zbl0155.28701MR220512
  8. 8. D. M. SIMMONS, One Dimensional Space Allocation : An Ordering Algorithm, Operations Research, vol. 17, 1969, p. 812-826. Zbl0182.53304MR249090
  9. 9. D. M. SIMMONS, A Further Note on One-Dimensional Space Allocations, Operations Research, vol. 19, 1971, p. 249. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.