An adaptive multistart tabu search approach to solve the maximum clique problem

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization
1. Verfasser:	Wu, Qinghua (VerfasserIn)
Weitere Verfasser:	Hao, Jin-Kao (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2013
Schlagworte:	tabu search > maximum clique > constrained neighborhood > informed restart > combinatorial optimization > Aufsatz in Zeitschrift
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Band
Special issue: Combinatorial optimization and applications	2013	25.2013,2
Special issue: Frontiers of algorithmics	2012	23.2012,3
Special issue: ISAAC '09	2012	24.2012,1
Selected papers from the fourteenth annual International Conference on Combinatorics and Computation (COCOON2008)	2011	21.2011,1
Selected papers from the fifteenth International Computing and Combinatorics Conference	2011	22.2011,3
Special issue: Selected papers from the Biennial International Symposium on Combinatorial Optimization (CO2008)	2010	19.2010,3
Special issue on data mining in biomedicine	2009	17.2009,1
Special issue part II: Selected papers from the 2nd Annual International Conference on Combinatorial Optimization and Application (COCOA 2008) Pt. II	2009	18.2009,4
Special issue: Selected papers from the 2nd Annual International Conference on Combinatorial Optimization and Application (COCOA 2008) Pt. I	2009	18.2009,3