Two different approaches of modeling the teacher relocation problem in a constraint logic programming system and their comparison

dc.contributor.authorHan, Nagehan
dc.contributor.authorBayrain, Zeki
dc.date.accessioned2026-02-06T18:28:58Z
dc.date.issued2007
dc.departmentDoğu Akdeniz Üniversitesi
dc.descriptionInternational Conference on Engineering Education, Instructional Technology, Assessment, and E-Learning -- DEC 04-14, 2006 -- ELECTR NETWORK
dc.description.abstractWe propose two ways of modeling the teacher relocation problem in the (ECLPSe)-P-i constraint logic programming system, implement them and compare their performance through simulation. The first one relies on logic variables that take on boolean values. The second one involves the use of the built-in predicates element and occurrences. Simulations confirm that the approach that uses the built-in predicates performs better in general.
dc.identifier.endpage460
dc.identifier.isbn978-1-4020-6261-2
dc.identifier.scopus2-s2.0-84878256749
dc.identifier.scopusqualityN/A
dc.identifier.startpage455
dc.identifier.urihttps://hdl.handle.net/11129/11196
dc.identifier.wosWOS:000253309900079
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofInnovations in E-Learning, Instruction Technology, Assessment, and Engineering Education
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.titleTwo different approaches of modeling the teacher relocation problem in a constraint logic programming system and their comparison
dc.typeConference Object

Files