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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	The Journal of the Operational Research Society Ročník 68; číslo 1; s. 102 - 110
Hlavní autori:	Alidaee, Bahram, Wang, Haibo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 01.01.2017 Taylor & Francis, Ltd Palgrave Macmillan UK Taylor & Francis Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!