The exam location problem: mathematical formulations and variants

DOI10.1016/J.COR.2023.106438MaRDI QIDQ6065634zbMATH OpenOpenAlexFDO

Authors Hatice Calik, T. Wauters, Greet Vanden Berghe

Publication date 15 November 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106438

zbMATH Keywords

integer programmingcapacitated facility location\(p\)-medianclosest assignment constraintsexam location

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A column generation approach to capacitated \(p\)-median problems
• A review on algorithms for maximum clique problems
• A survey of search methodologies and automated system development for examination timetabling
• An efficient Benders decomposition for the \(p\)-median problem
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Closest assignment constraints in discrete location problems
• College admissions with entrance exams: centralized versus decentralized
• Discrete center problems
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Solving large \(p\)-median problems with a radius formulation
• The Location of Emergency Service Facilities

This page was built for publication: The exam location problem: mathematical formulations and variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065634)