RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2008, Volume 15, Number 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

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.

Full text: PDF file (295 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.853.4
Received: 14.07.2008
Revised: 20.08.2008

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://www.ams.org/mathscinet-getitem?mr=2543149}
\zmath{https://zbmath.org/?q=an:1249.05365}


Linking options:
  • http://mi.mathnet.ru/eng/da554
  • http://mi.mathnet.ru/eng/da/v15/i6/p20

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. T. V. Gruzdeva, E. G. Petrova, “Numerical solution of a linear bilevel problem”, Comput. Math. Math. Phys., 50:10 (2010), 1631–1641  mathnet  crossref  adsnasa  isi
    2. Gruzdeva T.V., Klimentova K.B., “Metod otsechenii dlya neravenstv klik v zadache razmescheniya s predpochteniyami klientov”, Sovremennye tekhnologii. Sistemnyi analiz. Modelirovanie, 2011, no. 4, 31–39  elib
    3. I. L. Vasilyev, P. Avella, M. Boccia, “A branch and cut heuristic for a runway scheduling problem”, Autom. Remote Control, 77:11 (2016), 1985–1993  mathnet  crossref  isi  elib  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:1031
    Full text:296
    References:57
    First page:9

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020