The exam location problem: mathematical formulations and variants
From MaRDI portal
Publication:6065634
DOI10.1016/j.cor.2023.106438OpenAlexW4387007994MaRDI QIDQ6065634
Tony Wauters, Hatice Calik, 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
integer programming\(p\)-mediancapacitated facility locationclosest assignment constraintsexam location
Cites Work
- Closest assignment constraints in discrete location problems
- A survey of search methodologies and automated system development for examination timetabling
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A column generation approach to capacitated \(p\)-median problems
- College admissions with entrance exams: centralized versus decentralized
- A review on algorithms for maximum clique problems
- Solving Large p-Median Problems with a Radius Formulation
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
- Discrete Center Problems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The Location of Emergency Service Facilities
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- An efficient Benders decomposition for the \(p\)-median problem
This page was built for publication: The exam location problem: mathematical formulations and variants
