Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 6, Pages 20–33 (Mi da554)  
This article is cited in 3 scientific papers (total in 3 papers)

On solving the clique problem via the d. c. constraint problem

T. V. Gruzdeva

Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (295 kB) Citations (3)
References:
PDF
HTML
Abstract: The Maximum Weighted Clique Problem (MWCP) and the Maximum Clique Problem (MCP) are considered as continuous (nonconvex) problems with constraint given by the (d. c.) function which can be represented as the difference of two convex functions. For solving MWCP and MCP the Global Search Strategy is applied, that is the base of a heuristic algorithm. Each step of the algorithm is investigated. The computational effectiveness of this approach is illustrated in comparison with other approaches. Tabl. 4, bibl. 12.
Keywords: maximum clique, local search procedure, d. c. programming, global search algorithm.
Received: 14.07.2008
Revised: 20.08.2008
Bibliographic databases:
UDC: 519.853.4
Language: Russian
Citation: T. V. Gruzdeva, “On solving the clique problem via the d. c. constraint problem”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 20–33
Citation in format AMSBIB
\Bibitem{Gru08}
\by T.~V.~Gruzdeva
\paper On solving the clique problem via the d.\,c.~constraint problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 6
\pages 20--33
\mathnet{http://mi.mathnet.ru/da554}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2543149}
\zmath{https://zbmath.org/?q=an:1249.05365}
Linking options:
  • https://www.mathnet.ru/eng/da554
  • https://www.mathnet.ru/eng/da/v15/i6/p20
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:1200
    Full-text PDF :354
    References:90
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024