An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling

Omega

Volumn 25, Issue 4, 1997, Pages 473-482

  Weitz, Rob R ^a   Lakshminarayanan, S ^b  

^a SETON HALL UNIVERSITY   (United States)

^b MinMax Consulting   (United States)

Author keywords

Education; Graph theory; Heuristics; Timetabling

Indexed keywords

COMPUTATION THEORY; HEURISTIC METHODS; INTEGRATED CIRCUIT DESIGN; VLSI CIRCUITS;

EMPIRICAL COMPARISON; GRAPH THEORETIC APPROACH; GRAPH-THEORETIC METHODS; GROUP-BASED; HEURISTIC; MULTIPLE CRITERIA; PROJECT GROUPS; SCHEDULING TASKS; TIMETABLING; VLSI DESIGN;

GRAPH THEORY;

EID: 0031206365     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(97)00007-8     Document Type: Article

References (15)

1. Feo, T. and Khellaf, M., A class of bounded approximation algorithms for graph partitioning. Networks, 1990, 20, 181-195.
2. Lakshminarayanan, S. and Weitz, R., Creating Groups Of Maximum Diversity: Contrasting Math Programming and Heuristic Approaches. Working paper, Stillman School of Business, Seton Hall University, South Orange, NJ 07079, 1994/revised January 1996.
3. Weitz, R. and Lakshminarayanan, S., An Empirical Comparison of Heuristic Methods for Creating Maximally Diverse Groups. Working paper, Stillman School of Business, Seton Hall University, South Orange, 1996.
4. Lawler, E. L., The quadratic assignment problem. Management Science, 1963, 9, 586-599.
5. Weitz, R. R. and Jelassi, M. T., Assigning students to groups: a multi-criteria decision support system approach. Decision Sciences, 1992, 23, 746-757.
6. Lotfi, V. and Cerveny, R., A final exam scheduling package. Journal of the Operational Research Society, 1991, 42, 205-216.
7. Feo, T., Goldschmidt, O. and Khellaf, M., One-half approximation algorithms for the k-partition problem. Operations Research, 1992, 40 (suppl), S170-S173.
8. Weitz, R. and Lakshminarayanan, S., On a heuristic for the final exam scheduling problem. Journal of the Operational Research Society, 1996, 47, 599-600.
9. Arani, T. and Lotfi, V., A three phased approach to final exam scheduling. IIE Transactions, 1989, 21, 86-96.
10. Kuo, C.-C., Glover, F. and Dhir, K. S., Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sciences, 1993, 24, 1171-1185.
11. Mingers, J. and O'Brien, F. A., Creating student groups with similar characteristics: a heuristic approach. Omega, 1995, 23, 313-332.
12. O'Brien, F. A. and Mingers, J., The Equitable Partitioning Problem: A Heuristic Algorithm Applied to the Allocation of University Student Accommodation. Warwick Business School, Research Paper No. 187, June 1995.
13. Papadimitriou, C. H. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
14. Johnson, D. S. and McGeoch, C. C., Network Flows and Matching: First DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12, American Mathematical Society, Providence, R.I., 1993. (The program is available via anonymous ftp to dimacs.rutgers.edu and is in: /pub/netflow/matching/weighted/solver-1.)
15. Carpaneto, G. and Toth, P., ACM Transactions on Mathematical Software, Vol. 6, 1980, pp. 104-111, (The program, ASSCT: a Fortran subroutine for solving the square assignment problem, is available via the internet at http://math.nist.gov/cgi-bin/gams-serve/list-module-components/TOMS/548/8587.html).