f-Flip strategies for unconstrained binary quadratic programming

Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints. Current methods for solving UBQP problems customarily rely on neighborhoods consisting of f...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 238; číslo 1-2; s. 651 - 657
Hlavní autori:	Glover, Fred, Hao, Jin-Kao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2016 Springer Springer Nature B.V Springer Verlag
Predmet:	Algorithms Business and Management CAD Combinatorics Computer aided design Computer Science Mathematical research Operations research Operations Research/Decision Theory Optimization Quadratic programming Studies Theory of Computation Variables Multi-start algorithms Binary quadratic programming Computational efficiency Metaheuristics 0–1 Optimization metaheuristics
ISSN:	0254-5330, 1572-9338
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!