The exam location problem: mathematical formulations and variants
From MaRDI portal
Publication:6065634
DOI10.1016/J.COR.2023.106438OpenAlexW4387007994MaRDI QIDQ6065634FDOQ6065634
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
integer programmingcapacitated facility location\(p\)-medianclosest assignment constraintsexam location
Cites Work
- A column generation approach to capacitated \(p\)-median problems
- The Location of Emergency Service Facilities
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A survey of search methodologies and automated system development for examination timetabling
- Closest assignment constraints in discrete location problems
- A review on algorithms for maximum clique problems
- Solving large \(p\)-median problems with a radius formulation
- Discrete center problems
- College admissions with entrance exams: centralized versus decentralized
- An efficient Benders decomposition for the \(p\)-median problem
- 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
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)