Constraint Satisfaction and Optimization

No abstract yet.

In this work, we address a real-life course timetabling problem that incorporates several practical academic requirements, including the chronological precedence of theoretical sessions over practical ones, the enforcement of rest periods for lecturers, and the simultaneous assignment of lecturers and teaching assista…

In this work, we address a real-life course timetabling problem that incorporates several practical academic requirements, including the chronological precedence of theoretical sessions over practical ones, the enforcement of rest periods for lecturers, and the simultaneous assignment of lecturers and teaching assista…

This paper presents a three-stage mixed-integer programming (MIP) model for addressing the complex examination timetabling problem faced by 12 departments within a faculty. The first stage focuses on assigning days and time slots, the second stage allocates rooms, and the third stage assigns invigilators. Unlike tradi…

Nature-inspired metaheuristics are usually compared on how well they optimise. This study compares them on a property prior to performance: whether their behaviour survives transformations under which the optimisation problem is unchanged. Four axes are measured — translation and scaling of the search space, rotation,…

This paper presents an opportunistic, frame-first augmented reality (AR) pipeline for first-responder support that departs from scan-first approaches. The system anchors real-time object detections into world coordinates via the Meta Quest 3 depth API and maintains an egocentric scene graph encoding human–object and o…

No abstract yet.

No abstract yet.

The permutation flow shop scheduling problem (PFSP) is a fundamental scheduling problem for which heuristic methods are widely used due to the vast size of its solution space. This study investigates whether solution populations generated entirely from random permutations contain structural information capable of guid…

This paper introduces new forms of proximity space categories, namely, proxLS and dproxLS, spatial and descriptive proximity refinements of the Lusternik-Schnirelmann category LS and desProx, which is a descriptive proximity extension of the Császár Prox category. A main result given here is that a proximity space (X,…

Mantıksal programlama, biçimsel mantık temelli bir paradigma iken, durum yönelimli programlama Sonlu Durum Makineleri (Finite State Machines) üzerine inşa edilmiştir. Simülasyon ve etmen geliştirme amacıyla kullanılan bir dil olan Etmen Tabanlı Simülasyon Çerçevesi (EtSiS), programlama yaklaşımında hiyerarşik durum di…

Vernacular housing studies have documented spatial patterns in detail, yet the rules that generate these patterns are less often formalised within a single analytical framework. This article examines how traditional Datça houses can be read as a rule-governed plan language, drawing on 13 analytically selected cases fr…