default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas R. Stidsen
Person information
- affiliation: Technical University of Denmark, Kongens Lyngby, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j29]Mats Carlsson, Sara Ceschia
, Luca Di Gaspero, Rasmus Ø. Mikkelsen, Andrea Schaerf, Thomas Jacob Riis Stidsen:
Exact and metaheuristic methods for a real-world examination timetabling problem. J. Sched. 26(4): 353-367 (2023)- 2022
- [j28]Elín Björk Böðvarsdóttir, Niels-Christian Fink Bagger, Laura Elise Høffner, Thomas J. R. Stidsen:
A flexible mixed integer programming-based system for real-world nurse rostering. J. Sched. 25(1): 59-88 (2022) - [j27]Dennis S. Holm, Rasmus Ø. Mikkelsen, Matias Sørensen, Thomas J. R. Stidsen:
A graph-based MIP formulation of the International Timetabling Competition 2019. J. Sched. 25(4): 405-428 (2022) - 2021
- [j26]Elín Björk Böðvarsdóttir, Pieter Smet, Greet Vanden Berghe, Thomas J. R. Stidsen:
Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds. Eur. J. Oper. Res. 292(3): 980-995 (2021) - [j25]Torkil Kollsker, Thomas J. R. Stidsen:
Optimisation and Static Equilibrium of Three-Dimensional LEGO Constructions. Oper. Res. Forum 2(2) (2021) - 2020
- [j24]Anders Reenberg Andersen, Thomas Jacob Riis Stidsen, Line Blander Reinhardt:
Simulation-Based Rolling Horizon Scheduling for Operating Theatres. Oper. Res. Forum 1(2) (2020) - 2019
- [j23]Niels-Christian Fink Bagger, Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen:
Flow formulations for curriculum-based course timetabling. Ann. Oper. Res. 280(1-2): 121-150 (2019) - [j22]Anders Reenberg Andersen, Bo Friis Nielsen, Line Blander Reinhardt, Thomas Riis Stidsen:
Staff optimization for time-dependent acute patient flow. Eur. J. Oper. Res. 272(1): 94-105 (2019) - [j21]Niels-Christian Fink Bagger, Matias Sørensen, Thomas R. Stidsen:
Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling. Eur. J. Oper. Res. 272(2): 430-446 (2019) - [j20]Michael Lindahl, Thomas R. Stidsen, Matias Sørensen:
Quality recovering of university timetables. Eur. J. Oper. Res. 276(2): 422-435 (2019) - 2018
- [j19]Niels-Christian Fink Bagger, Matias Sørensen, Thomas R. Stidsen:
Benders' decomposition for curriculum-based course timetabling. Comput. Oper. Res. 91: 178-189 (2018) - [j18]Thomas R. Stidsen, Kim Allan Andersen:
A hybrid approach for biobjective optimization. Discret. Optim. 28: 89-114 (2018) - [j17]Michael Lindahl, Andrew J. Mason, Thomas R. Stidsen, Matias Sørensen:
A strategic view of University timetabling. Eur. J. Oper. Res. 266(1): 35-45 (2018) - [j16]Thomas R. Stidsen, David Pisinger, Daniele Vigo:
Scheduling EURO-k conferences. Eur. J. Oper. Res. 270(3): 1138-1147 (2018) - [j15]Michael Lindahl, Matias Sørensen, Thomas R. Stidsen:
A fix-and-optimize matheuristic for university timetabling. J. Heuristics 24(4): 645-665 (2018) - 2017
- [j14]George H. G. Fonseca, Haroldo G. Santos, Eduardo G. Carrano, Thomas R. Stidsen:
Integer programming techniques for educational timetabling. Eur. J. Oper. Res. 262(1): 28-39 (2017) - 2016
- [j13]Simon Kristiansen, Thomas R. Stidsen:
Elective course student sectioning at Danish high schools. Ann. Oper. Res. 239(1): 99-117 (2016) - 2015
- [j12]Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen:
Integer programming for the generalized high school timetabling problem. J. Sched. 18(4): 377-392 (2015) - 2014
- [j11]Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen:
Heuristic methods for single link shared backup path protection. J. Heuristics 20(5): 539-560 (2014) - [j10]Thomas R. Stidsen, Kim Allan Andersen, Bernd Dammann:
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs. Manag. Sci. 60(4): 1009-1032 (2014) - 2013
- [j9]Simon Kristiansen, Matias Sørensen, Michael B. Herold, Thomas R. Stidsen:
The consultation timetabling problem at Danish high schools. J. Heuristics 19(3): 465-495 (2013) - 2011
- [j8]Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen:
Elective course planning. Eur. J. Oper. Res. 215(3): 713-720 (2011) - [j7]Min Wen, Emil Krapper, Jesper Larsen, Thomas K. Stidsen:
A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem. Networks 58(4): 311-322 (2011) - 2010
- [j6]Thomas R. Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen:
Optimal routing with failure-independent path protection. Networks 55(2): 125-137 (2010) - 2008
- [j5]Fernando Solano, Thomas R. Stidsen, Ramón Fabregat, José-Luis Marzo:
Label space reduction in MPLS networks: how much can a single stacked label do? IEEE/ACM Trans. Netw. 16(6): 1308-1320 (2008) - 2007
- [j4]Tommy Thomadsen, Thomas R. Stidsen:
The generalized fixed-charge network design problem. Comput. Oper. Res. 34(4): 997-1007 (2007) - 2005
- [j3]Tommy Thomadsen, Thomas R. Stidsen:
Hierarchical Ring Network Design Using Branch-and-Price. Telecommun. Syst. 29(1): 61-76 (2005) - 2004
- [j2]Halldór Matthías Sigurðsson, Saemundur E. Thorsteinsson, Thomas K. Stidsen:
Cost optimization methods in the design of next generation networks. IEEE Commun. Mag. 42(9): 118-122 (2004) - 2000
- [j1]Zbigniew Michalewicz, Kalyanmoy Deb, Martin Schmidt, Thomas R. Stidsen:
Test-case generator for nonlinear continuous parameter optimization techniques. IEEE Trans. Evol. Comput. 4(3): 197-215 (2000)
Conference and Workshop Papers
- 2012
- [c6]Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen:
Heuristic methods for shared backup path protection planning. ICUMT 2012: 712-718 - 2006
- [c5]Jan Madsen, Thomas K. Stidsen, Peter Kjaerulf, Shankar Mahadevan:
Multi-Objective Design Space Exploration of Embedded System Platforms. DIPES 2006: 185-194 - 1999
- [c4]Zbigniew Michalewicz, Kalyanmoy Deb, Martin Schmidt, Thomas J. R. Stidsen:
Towards understanding constraint-handling methods in evolutionary algorithms. CEC 1999: 581-588 - [c3]Thomas J. R. Stidsen, Ole Caprani, Zbigniew Michalewicz:
A parabolic operator for parameter optimization problems. CEC 1999: 1494-1500 - 1996
- [c2]Thomas R. Stidsen, L. V. Kragelund, O. Mateescu:
Jobshop Scheduling in a Shipyard. ECAI 1996: 639-646 - 1995
- [c1]Martin Schmidt, Thomas R. Stidsen:
Using GA to Train NN Using Sharing and Pruning. SCAI 1995: 145-156
Parts in Books or Collections
- 2010
- [p2]Fernando Solano, Luis Fernando Caro, Thomas R. Stidsen, Dimitri Papadimitriou:
Routing and Label Space Reduction in Label Switching Networks. Graphs and Algorithms in Communication Networks 2010: 119-136 - [p1]José-Luis Marzo, Thomas R. Stidsen, Sarah Ruepp, Eusebi Calle, János Tapolcai, Juan Segovia:
Network Survivability: End-to-End Recovery Using Local Failure Information. Graphs and Algorithms in Communication Networks 2010: 137-161
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
