Facet-generating procedures for the maximum-impact coloring polytope
From MaRDI portal
Publication:5918669
DOI10.1016/j.entcs.2019.08.018OpenAlexW2977253763WikidataQ113317414 ScholiaQ113317414MaRDI QIDQ5918669
Publication date: 27 April 2022
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.018
Related Items
Cites Work
- Unnamed Item
- Integer programming methods for large-scale practical classroom assignment problems
- An introduction to timetabling
- An integer programming formulation for a case study in university timetabling.
- A branch-and-cut procedure for the Udine course timetabling problem
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- The maximum-impact coloring polytope