( en | de | ru )

 

Disambiguation of "Schlechte, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
On the Path Avoiding Forbidden Pairs Polytope.

, , , , and . Electron. Notes Discret. Math., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Schlechte

Monika Schlechte

Reinhard Schlechte

Ilka Schlechte

Georg Schlechte

 

Other publications of authors with the same name

Fastest, Average and Quantile Schedule., , , , and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 201-216. Springer, (2015)Solving Railway Track Allocation Problems., and . OR, page 117-122. Springer, (2007)Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling., , and . ATMOS, volume 106 of OASIcs, page 11:1-11:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Re-Optimization of Rolling Stock Rotations., , , , and . OR, page 49-55. Springer, (2013)Analysis of Micro-Macro Transformations of Railway Networks., and . OR, page 37-42. Springer, (2013)The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic., , , , , and . Transp. Sci., 50 (2): 408-423 (2016)Strong Relaxations for the Train Timetabling Problem Using Connected Configurations., and . ATMOS, volume 59 of OASIcs, page 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem., , and . ATMOS, volume 42 of OASIcs, page 79-91. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance., , , and . ATMOS, volume 75 of OASIcs, page 1:1-1:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Structure-Based Decomposition for Pattern-Detection for Railway Timetables., , and . OR, page 715-721. Springer, (2017)