Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Eric Thiémard"'
Publikováno v:
Journal of Scheduling. 25:391-404
This article presents a mixed-integer programming model for solving the university timetabling problem which considers the allocation of students to classes and the assignment of rooms and time periods to each class. The model was developed as part o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7db6f258ba2f0959b8c8d12f178ca8eb
https://doi.org/10.1007/s10951-021-00715-5
https://doi.org/10.1007/s10951-021-00715-5
Autor:
Eric Thiémard
Publikováno v:
Journal of Complexity. 17:850-880
We propose an algorithm to compute upper and lower bounds for the star discrepancy of an arbitrary sequence of points in the s-dimensional unit cube. The method is based on a particular partition of the unit cube into subintervals and on a specialize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9901a9a7154dcf294c152e130d1c5d69
https://doi.org/10.1006/jcom.2001.0600
https://doi.org/10.1006/jcom.2001.0600
Autor:
Eric Thiémard
Publikováno v:
Mathematical Methods of Operations Research (ZOR). 54:21-45
Given n points in the s-dimensional unit cube, we consider the problem of finding a subinterval of minimum or maximum volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to tackle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b110977d2e75de2ebace65f593c7c93
https://doi.org/10.1007/s001860100141
https://doi.org/10.1007/s001860100141