METOD SEDIMENTACIJE I NJEGOVE PRIMJENE U PROBLEMIMA DISKRETNE MATEMATIKE

eBiblioteka

 
 

METOD SEDIMENTACIJE I NJEGOVE PRIMJENE U PROBLEMIMA DISKRETNE MATEMATIKE

Show simple item record

dc.contributor.advisor Mijajlović, Žarko
dc.contributor.author Kordić, Stevan
dc.date.accessioned 2017-01-24T16:41:28Z
dc.date.available 2017-01-24T16:41:28Z
dc.date.issued 2016
dc.identifier.uri http://hdl.handle.net/123456789/4413
dc.description.abstract Constrain satisfaction problems including the optimisation problems are among the most important problems of discrete mathematics with wide area of application in mathematics itself and in the applied mathematics. Dissertation study optimisation problem and presents an original method for finding its exact solution. The name of the method is Sedimentation Algorithm, which is introduced together with two heuristics. It belongs to the class of branch-and-bound algorithms, which uses backtracking and forward checking techniques. The Sedimentation Algorithm is proven to be totally correct. Ability of the Sedimentation Algorithm to solve different type of problems is demonstrated in dissertation by its application on the Boolean satisfiability problems, the Whitehead Minimisation Problem and the Berth Allocation Problem in container port. The best results are obtained for Berth Allocation Problem, because its modelling for Sedimentation Algorithm includes all available optimisation techniques of the method. The precise complexity estimation of the Sedimentation Algorithm for the Berth Allocation Problem is established. Experimental results verify that the Sedimentation Algorithm is capable to solve the Berth Allocation Problem on the state of art level. en_US
dc.description.provenance Submitted by Slavisha Milisavljevic (slavisha) on 2017-01-24T16:41:28Z No. of bitstreams: 1 StevanKordic.pdf: 2477801 bytes, checksum: 9f2af4cd2740bd0d495a6219223585fa (MD5) en
dc.description.provenance Made available in DSpace on 2017-01-24T16:41:28Z (GMT). No. of bitstreams: 1 StevanKordic.pdf: 2477801 bytes, checksum: 9f2af4cd2740bd0d495a6219223585fa (MD5) Previous issue date: 2016 en
dc.language.iso sr en_US
dc.publisher Beograd en_US
dc.title METOD SEDIMENTACIJE I NJEGOVE PRIMJENE U PROBLEMIMA DISKRETNE MATEMATIKE en_US
mf.author.birth-date 1969-04-20
mf.subject.area Mathematics en_US
mf.subject.keywords constrain satisfaction problem, optimisation problem, discrete mathematics, combinatorial optimisation, exact solution, algorithm, Boolean satisfiability, Whitehead minimisation problem, berth Allocation problem en_US
mf.subject.subarea Discrete mathematics en_US
mf.contributor.committee Davidović, Tatjana
mf.contributor.committee Janičić, Predrag
mf.university.faculty Mathematical Faculty en_US
mf.document.references 79 en_US
mf.document.pages 130 en_US
mf.document.location Beograd en_US
mf.document.genealogy-project No en_US
mf.author.parent Ljuba en_US
mf.university Belgrade University en_US

Files in this item

Files Size Format View
StevanKordic.pdf 2.477Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record