Using GA to Train NN Using Sharing and Pruning. - Martin Schmidt 001; Thomas R. Stidsen (SCAI, 1995)

Jobshop Scheduling in a Shipyard. - Thomas R. Stidsen; L. V. Kragelund; O. Mateescu (ECAI, 1996)

Towards understanding constraint-handling methods in evolutionary algorithms. - Zbigniew Michalewicz; Kalyanmoy Deb; Martin Schmidt 001; Thomas J. R. Stidsen (CEC, 1999)

A parabolic operator for parameter optimization problems. - Thomas J. R. Stidsen; Ole Caprani; Zbigniew Michalewicz (CEC, 1999)

Test-case generator for nonlinear continuous parameter optimization techniques. - Zbigniew Michalewicz; Kalyanmoy Deb; Martin Schmidt 001; Thomas R. Stidsen (IEEE Trans. Evol. Comput., 2000)

Cost optimization methods in the design of next generation networks. - Halldór Matthías Sigurðsson; Saemundur E. Thorsteinsson; Thomas K. Stidsen (IEEE Commun. Mag., 2004)

Hierarchical Ring Network Design Using Branch-and-Price. - Tommy Thomadsen; Thomas R. Stidsen (Telecommun. Syst., 2005)

Multi-Objective Design Space Exploration of Embedded System Platforms. - Jan Madsen; Thomas K. Stidsen; Peter Kjaerulf; Shankar Mahadevan (DIPES, 2006)

The generalized fixed-charge network design problem. - Tommy Thomadsen; Thomas R. Stidsen (Comput. Oper. Res., 2007)

Label space reduction in MPLS networks: how much can a single stacked label do? - Fernando Solano; Thomas R. Stidsen; Ramón Fabregat; José-Luis Marzo (IEEE/ACM Trans. Netw., 2008)

Network Survivability: End-to-End Recovery Using Local Failure Information. - José-Luis Marzo; Thomas R. Stidsen; Sarah Ruepp; Eusebi Calle; János Tapolcai; Juan Segovia (Graphs and Algorithms in Communication Networks, 2010)

Routing and Label Space Reduction in Label Switching Networks. - Fernando Solano; Luis Fernando Caro; Thomas R. Stidsen; Dimitri Papadimitriou (Graphs and Algorithms in Communication Networks, 2010)

Optimal routing with failure-independent path protection. - Thomas R. Stidsen; Bjørn Petersen; Simon Spoorendonk; Martin Zachariasen; Kasper Bonne Rasmussen (Networks, 2010)

Elective course planning. - Simon Kristiansen; Matias Sørensen; Thomas R. Stidsen (Eur. J. Oper. Res., 2011)

A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem. - Min Wen; Emil Krapper; Jesper Larsen; Thomas K. Stidsen (Networks, 2011)

Heuristic methods for shared backup path protection planning. - Jørgen Thorlund Haahr; Thomas R. Stidsen; Martin Zachariasen (ICUMT, 2012)

The consultation timetabling problem at Danish high schools. - Simon Kristiansen; Matias Sørensen; Michael B. Herold; Thomas R. Stidsen (J. Heuristics, 2013)

Heuristic methods for single link shared backup path protection. - Jørgen Thorlund Haahr; Thomas R. Stidsen; Martin Zachariasen (J. Heuristics, 2014)

A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs. - Thomas R. Stidsen; Kim Allan Andersen; Bernd Dammann (Manag. Sci., 2014)

Integer programming for the generalized high school timetabling problem. - Simon Kristiansen; Matias Sørensen; Thomas R. Stidsen (J. Sched., 2015)

Elective course student sectioning at Danish high schools. - Simon Kristiansen; Thomas R. Stidsen (Ann. Oper. Res., 2016)

Integer programming techniques for educational timetabling. - George H. G. Fonseca; Haroldo G. Santos; Eduardo G. Carrano; Thomas R. Stidsen (Eur. J. Oper. Res., 2017)

Benders' decomposition for curriculum-based course timetabling. - Niels-Christian Fink Bagger; Matias Sørensen; Thomas R. Stidsen (Comput. Oper. Res., 2018)

A hybrid approach for biobjective optimization. - Thomas R. Stidsen; Kim Allan Andersen (Discret. Optim., 2018)

A strategic view of University timetabling. - Michael Lindahl; Andrew J. Mason; Thomas R. Stidsen; Matias Sørensen (Eur. J. Oper. Res., 2018)

Scheduling EURO-k conferences. - Thomas R. Stidsen; David Pisinger; Daniele Vigo (Eur. J. Oper. Res., 2018)

A fix-and-optimize matheuristic for university timetabling. - Michael Lindahl; Matias Sørensen; Thomas R. Stidsen (J. Heuristics, 2018)

Flow formulations for curriculum-based course timetabling. - Niels-Christian Fink Bagger; Simon Kristiansen; Matias Sørensen; Thomas R. Stidsen (Ann. Oper. Res., 2019)

Staff optimization for time-dependent acute patient flow. - Anders Reenberg Andersen; Bo Friis Nielsen; Line Blander Reinhardt; Thomas Riis Stidsen (Eur. J. Oper. Res., 2019)

Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling. - Niels-Christian Fink Bagger; Matias Sørensen; Thomas R. Stidsen (Eur. J. Oper. Res., 2019)

Quality recovering of university timetables. - Michael Lindahl; Thomas R. Stidsen; Matias Sørensen (Eur. J. Oper. Res., 2019)

Simulation-Based Rolling Horizon Scheduling for Operating Theatres. - Anders Reenberg Andersen; Thomas Jacob Riis Stidsen; Line Blander Reinhardt (Oper. Res. Forum, 2020)

Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds. - Elín Björk Böðvarsdóttir; Pieter Smet; Greet Vanden Berghe; Thomas J. R. Stidsen (Eur. J. Oper. Res., 2021)

Optimisation and Static Equilibrium of Three-Dimensional LEGO Constructions. - Torkil Kollsker; Thomas J. R. Stidsen (Oper. Res. Forum, 2021)

A flexible mixed integer programming-based system for real-world nurse rostering. - Elín Björk Böðvarsdóttir; Niels-Christian Fink Bagger; Laura Elise Høffner; Thomas J. R. Stidsen (J. Sched., 2022)

A graph-based MIP formulation of the International Timetabling Competition 2019. - Dennis S. Holm; Rasmus Ø. Mikkelsen; Matias Sørensen; Thomas J. R. Stidsen (J. Sched., 2022)

Exact and metaheuristic methods for a real-world examination timetabling problem. - Mats Carlsson; Sara Ceschia; Luca Di Gaspero; Rasmus Ø. Mikkelsen; Andrea Schaerf; Thomas Jacob Riis Stidsen (J. Sched., 2023)