Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
On solving the maximum clique problem
Autore:
Kuznetsova, A; Strekalovsky, A;
Indirizzi:
RAS, Inst Syst Dynam & Control Theory SB, Irkutsk 664033 33, Russia RAS Irkutsk Russia 664033 33 ontrol Theory SB, Irkutsk 664033 33, Russia
Titolo Testata:
JOURNAL OF GLOBAL OPTIMIZATION
fascicolo: 3, volume: 21, anno: 2001,
pagine: 265 - 288
SICI:
0925-5001(2001)21:3<265:OSTMCP>2.0.ZU;2-8
Fonte:
ISI
Lingua:
ENG
Soggetto:
SEARCH;
Keywords:
d.c. maximization; global optimality conditions; local search; linearized problem; global search algorithm;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
15
Recensione:
Indirizzi per estratti:
Indirizzo: Kuznetsova, A RAS, Inst Syst Dynam & Control Theory SB, Lermontov Str 134,Irkutsk 664033 33, Russia RAS Lermontov Str 134 Irkutsk Russia 664033 33 3 33, Russia
Citazione:
A. Kuznetsova e A. Strekalovsky, "On solving the maximum clique problem", J GLOB OPT, 21(3), 2001, pp. 265-288

Abstract

The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with otherGlobal Search approaches.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 03/04/20 alle ore 13:23:48