Computational aspects of the maximum diversity problem

Operations Research Letters

Volumn 19, Issue 4, 1996, Pages 175-181

  Ghosh, Jay B ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Computational complexity; Heuristics; Maximum diversity

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING;

MAXIMUM DIVERSITY PROBLEM; RANDOMIZED GREEDY HEURISTICS;

OPERATIONS RESEARCH;

EID: 0030263520     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(96)00025-9     Document Type: Article

References (10)

1. R.E. Burkard and F. Rendl, "Lexicographic bottleneck problems", Oper. Res. Lett. 10, 303-308 (1991).
2. T.A. Feo, V. Krishnamurthy and J.F. Bard, "A GRASP for a difficult single machine scheduling problem", Comput. Oper. Res. 18, 635-643 (1991).
3. T.A. Feo and M.G.C. Resende, "Greedy randomized adaptive search procedures", J. Global Optim. 6, 109-133 (1995).
4. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
5. F. Glover, "Advanced netform models for the maximum diversity problem", Working Paper, Graduate School of Business Administration, University of Colorado at Boulder, Boulder, Colorado, 1991.
6. J.P. Hart and A.W. Shogan, "Semi-greedy heuristics: an empirical study", Oper. Res. Lett. 6, 107-114 (1987).
7. C.-C. Kuo, F. Glover and K.S. Dhir, "Analyzing and modeling the maximum diversity problem by zero-one programming", Dec. Sci. 24, 1171-1185 (1993).
8. P.M. Pardalos and G.P. Rodgers, "Computational aspects of a branch and bound algorithm for quadratic zero-one programming", Computing 45, 131-144 (1990).
9. P.M. Pardalos and H. Wolkowicz (eds.), Quadratic Assignment and Related Problems, DIMACS Series, Vol. 16, American Mathematical Society, 1994.
10. P.M. Pardalos, A.T. Phillips and J.B. Rosen, Topics in Parallel Computing in Mathematical Programming, Science Press, Moscow, 1993.