Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/923
DC FieldValueLanguage
dc.contributor.authorČangalović, Mirjanaen_US
dc.contributor.authorKovacevic-Vujcic, Veraen_US
dc.contributor.authorIvanović, Laven_US
dc.contributor.authorDražić, Milanen_US
dc.date.accessioned2022-08-16T11:02:02Z-
dc.date.available2022-08-16T11:02:02Z-
dc.date.issued1998-10-16-
dc.identifier.issn03772217en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/923-
dc.description.abstractA real-life problem of assigning students to exams during an examination period is modeled as an optimization problem over the set of maximal cliques of a specially structured weighted graph. The problem is solved using a combination of special-purpose heuristic and Tabu search. Numerical results of experiments with real-life data from Belgrade Law School are reported. © 1998 Elsevier Science B.V. All rights reserved.en
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectAssignmenten
dc.subjectCliques in graphsen
dc.subjectCombinatorial optimizationen
dc.subjectHeuristicsen
dc.subjectTabu searchen
dc.titleModeling and solving a real-life assignment problem at universitiesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0377-2217(98)00028-9-
dc.identifier.scopus2-s2.0-0032187817-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0032187817-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage223en
dc.relation.lastpage233en
dc.relation.volume110en
dc.relation.issue2en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

4
checked on Nov 8, 2024

Page view(s)

16
checked on Nov 14, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.