Heuristic and exact algorithms for the simultaneous assignment problem

European Journal of Operational Research

Volumn 123, Issue 3, 2000, Pages 531-542

  Yamada, Takeo ^a   Nasu, Yasushi ^a  

^a NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES;

PEGGING TEST; SIMULTANEOUS ASSIGNMENT PROBLEM;

RESOURCE ALLOCATION;

EID: 0033727977     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00100-9     Document Type: Article

References (17)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Bannasiri B., Yamada T. Class assignment methods considering students' preferences and academic records (in Japanese). Scientific and Engineering Reports of the National Defense Academy. 35:1997;57-62.
3. Belford P.C., Ratliff H.D. A network-flow model for racially balancing schools. Operations Research. 20:1972;619-628.
4. D.P. Bertsekas, Linear Network Optimization: Algorithms and Codes, MIT Press, Cambridge, MA, 1991.
5. V. Chvátal, Linear Programming, Freeman, San Francisco, CA, 1983.
6. G.B. Danzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
7. Dijkstra E.W. A note on two problems in connection with graphs. Numerische Mathematik. 1:1959;269-271.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
9. M.R. Greenberg, Applied Linear Programming for the Socioeconomic and Environment Sciences, Academic Press, New York, NY, 1978.
10. T. Ibaraki, M. Fukushima, FORTRAN77 Optimization Programming (in Japanese), Iwanami, Tokyo, 1991.
11. S. Kamata, A. Ohuchi et al., Class assignment methods taking students' preferences and academic records into account (in Japanese), Conference of SICE Hokkaido Branch, Sapporo, 1997.
12. H. Konno, H. Suzuki, Integer Programming and Combinatorial Optimization (in Japanese), Nikka-Giren, Tokyo, 1982.
13. Konno H., Zhe Z. Optimal class assignment problem: A case study at Tokyo Institute of Technology (in Japanese). Communications of the OR Society of Japan. 36:1991;85-89.
14. Kuhn N.W. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly. 2:1955;83-97.
15. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinhart & Winston, New York, NY, 1979.
16. R.M. Nauss, Parametric Integer Programming, University of Missouri Press, Columbia, MI, 1979.
17. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.