Computational aspects of the maximum diversity problem

Greedy Randomized Adaptive Search Procedures

Thomas A. Feo, Maurício G. C. Resende · Journal of Global Optimization · 1995 · 2.7K citations

Computing, Computer Science, Mathematics +10

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Pãnos M. Pardalos, Gregory Rodgers · Computing · 1990 · 266 citations

Computing, Computer Science, Algorithms +14

Semi-greedy heuristics: An empirical study

Julia Hart, Andrew W. Shogan · Operations Research Letters · 1987 · 207 citations

Computing, Decision Sciences, Algorithms +12

Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*

Ching‐Chung Kuo, Fred Glover, Krishna S. Dhir · Decision Sciences · 1993 · 206 citations

Natural Sciences, Mathematics, Diversification Strategy +13

A GRASP™ for a difficult single machine scheduling problem

Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard · Computers & Operations Research · 1991 · 89 citations

Management, Industrial Engineering, Operations Management +10