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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	The Journal of the Operational Research Society Jg. 68; H. 1; S. 102 - 110
Hauptverfasser:	Alidaee, Bahram, Wang, Haibo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 01.01.2017 Taylor & Francis, Ltd Palgrave Macmillan UK Taylor & Francis Ltd
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!