Path relinking for unconstrained binary quadratic programming

► We devise for the first time two Path Relinking methods for UBQP. ► We assess the performance of these methods on both random and structured benchmark problems. ► The proposed methods improve the previous best known results for almost 40 percent of the 103 MaxCut instances. ► The proposed methods...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 223; číslo 3; s. 595 - 604
Hlavní autoři:	Wang, Yang, Lü, Zhipeng, Glover, Fred, Hao, Jin-Kao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.12.2012 Elsevier Elsevier Sequoia S.A
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Benchmarks Comparative analysis Computational efficiency Computer Science Computer science; control theory; systems Effectiveness Exact sciences and technology Information retrieval. Graph Mathematical models Mathematical problems Mathematical programming MaxCut Operational research Operational research and scientific management Operational research. Management science Path relinking Quadratic programming Strategy Studies Tabu search Theoretical computing UBQP Path relinking UBQP Tabu search MaxCut Unconstrained optimization Zero one programming Probabilistic approach Graph cut Efficiency Evolutionary algorithm Combinatorial optimization Quadratic programming
ISSN:	0377-2217, 1872-6860
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!

Buďte první, kdo okomentuje tento záznam!