A note on heuristic approach based on UBQP formulation of the maximum diversity problem

The maximum diversity problem (MDP) is a challenging NP-hard problem with a wide range of real applications. Several researchers have pointed out close relationship between the MDP and unconstrained binary quadratic program (UBQP). In this paper, we provide procedures to solve MDP ideas from the UBQ...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of the Operational Research Society Vol. 68; no. 1; pp. 102 - 110
Main Authors:	Alidaee, Bahram, Wang, Haibo
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 01.01.2017 Taylor & Francis, Ltd Palgrave Macmillan UK Taylor & Francis Ltd
Subjects:	Business and Management combinatorial optimization problem diversification strategy Heuristic methods Management maximum diversity problem Operations Research/Decision Theory r-flip local search Tabu search unconstrained binary quadratic programming maximum diversity problem diversification strategy - local search combinatorial optimization problem unconstrained binary quadratic programming
ISSN:	0160-5682, 1476-9360
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!