National Repository of Dissertations in Serbia
    • English
    • Српски
    • Српски (Serbia)
  • English 
    • English
    • Serbian (Cyrilic)
    • Serbian (Latin)
  • Login
View Item 
  •   NaRDuS home
  • Универзитет у Новом Саду
  • Факултет техничких наука
  • View Item
  •   NaRDuS home
  • Универзитет у Новом Саду
  • Факултет техничких наука
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Metode promena formulacija i okolina za problem maksimalne klike grafa

Variable Formulation and Neighborhood Search Methods for the Maximum Clique Problem in Graph

Thumbnail
2016
Disertacija4671.pdf (1.940Mb)
IzvestajKomisije4671.pdf (369.7Kb)
Author
Janićijević, Stefana
Mentor
Mladenović, Nenad
Committee members
Urošević, Dragan
Sladoje-Matić, Nataša
Davidović, Tatjana
Lukić, Tibor
Mladenović, Nenad
Metadata
Show full item record
Abstract
Doktorska disertacija se bavi temama rešavanja računarski teških problema kombinatorne optimizacije. Istaknut je problem maksimalne klike kao predstavnik određenih struktura u grafovima. Problem maksimalne klike i sa njim povezani problemi su formulisani kao nelinearne funkcije. Rešavani su sa ciljem otkrivanja novih metoda koje pronalaze dobre aproksimacije rešenja za neko razumno vreme. Predložene su varijante Metode promenljivih okolina na rešavanje maksimalne klike u grafu. Povezani problemi na grafovima se mogu primeniti na pretragu informacija, raspoređivanje, procesiranje signala, teoriju klasifikacije, teoriju kodiranja, itd. Svi algoritmi su implementirani i uspešno testirani na brojnim različitim primerima.
This Ph.D. thesis addresses topics NP hard problem solving approaches in combinatorial optimization and according to that it is highlighted maximum clique problem as a representative of certain structures in graphs. Maximum clique problem and related problems with this have been formulated as non linear functions which have been solved to research for new methods and good solution approximations for some reasonable time. It has been proposed several different extensions of Variable Neighborhood Search method. Related problems on graphs could be applied on information retrieval, scheduling, signal processing, theory of classi_cation, theory of coding, etc. Algorithms are implemented and successfully tested on various different tasks.
Faculty:
Универзитет у Новом Саду, Факултет техничких наука
Date:
29-09-2016
Keywords:
Maksimalna klika / Variable Neighborhood Search / Formulation Space Search / Maximum Clique Global Optimization / Models / Big Data / Metoda promenljivih okolina / Pretraga kroz prostor formulacija / Modeli / Globalna optimizacija / Velike baze podataka
[ Google Scholar ]
Handle
https://hdl.handle.net/21.15107/rcub_nardus_6620
URI
http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=NaRDuS&language=sr
https://nardus.mpn.gov.rs/handle/123456789/6620
http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=NaRDuS&language=sr
http://www.cris.uns.ac.rs/DownloadFileServlet/IzvestajKomisije146796915042793.pdf?controlNumber=(BISIS)101446&fileName=146796915042793.pdf&id=6338&source=NaRDuS&language=sr

DSpace software copyright © 2002-2015  DuraSpace
About NaRDus | Contact us

OpenAIRERCUBRODOSTEMPUS
 

 

Browse

All of DSpaceUniversities & FacultiesAuthorsMentorCommittee membersSubjectsThis CollectionAuthorsMentorCommittee membersSubjects

DSpace software copyright © 2002-2015  DuraSpace
About NaRDus | Contact us

OpenAIRERCUBRODOSTEMPUS