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ženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 238; číslo 1-2; s. 651 - 657
Hlavní autoři: Glover, Fred, Hao, Jin-Kao
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2016
Springer
Springer Nature B.V
Springer Verlag
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 flip moves that select one or more binary variables and “flip” their values to the complementary value (from 1 to 0 or from 0 to 1). We introduce a class of approaches called f-flip strategies that include a fractional value f as one of those available to the binary variables during intermediate stages of solution. A variety of different f-flip strategies, particularly within the context of multi-start algorithms, are proposed for pursuing intensification and diversification goals in metaheuristic algorithms, accompanied by special rules for evaluating and executing f-flips efficiently.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-015-2076-1