seminars
Detail
Publication date: 1 de June, 2021On the scheduling of periodic events
How should regular N polygons be inscribed on a circle so that the minimum distance z between two adjacent vertices is as large as possible?
How should trains that arrive at a railway station in constant intervals be scheduled so that the safety interval z between two trains is maximum?
For this problem Ill present Mixed Integer Linear Programming (MILP) formulations, describe a procedure to obtain bounds on maximum z, and report computational experiments. Ill also consider a restricted version of the problem, for which Ill give a combinatorial procedure to find optimal solutions, compare the performance of this approach with the MILP model, and prove that the problem is NP-hard.
Joint work with Ricardo Saldanha, SISCOG and Pedro Cristiano Silva, Univ of Lisbon.
| Date | 22/11/2017 |
|---|---|
| State | Concluded |
| Host Bio | Jorge Orestes Cerdeira obtained his Habilitation in Mathematics from the Technical University of Lisbon in 2003, and his PhD in Algebra and Logic from the University of Lisbon in 1990. His research interests include graphs, combinatorial optimization, industrial applications, conservation biology, and macroecology. He is currently Full Professor at the Department of Mathematics of the Faculty of Sciences and Technology of the New University of Lisbon, and coordinates the thematic line Mathematical Models in Ecology, Evolution and Genetics from the Center for Mathematics and Applications (CMA). |