Search Results - person:"Theis, Dirk"

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope

Khoshkhah, Kaveh; Theis, Dirk - In: Operations research letters 46 (2018) 3, pp. 352-355

Persistent link: https://www.econbiz.de/10011873647

Compact formulations of the Steiner Traveling Salesman Problem and related problems

Letchford, Adam N.; Nasiri, Saeideh D.; Theis, Dirk - In: European journal of operational research : EJOR 228 (2013) 1, pp. 83-92

Persistent link: https://www.econbiz.de/10009734153

Compact formulations of the Steiner Traveling Salesman Problem and related problems

Letchford, Adam N.; Nasiri, Saeideh D.; Theis, Dirk Oliver - In: European Journal of Operational Research 228 (2013) 1, pp. 83-92

The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable when routing on real-life road networks. The standard integer programming formulations of both the TSP and STSP have an exponential number of constraints. On the other hand, several compact...

Persistent link: https://www.econbiz.de/10010871125

Compact formulations of the Steiner Traveling Salesman Problem and related problems

Letchford, Adam N.; Nasiri, Saeideh D.; Theis, Dirk Oliver - In: European journal of operational research : EJOR 228 (2013) 1, pp. 83-92

Persistent link: https://www.econbiz.de/10010092320

A branch and cut solver for the maximum stable set problem

Rebennack, Steffen; Oswald, Marcus; Theis, Dirk Oliver; … - In: Journal of combinatorial optimization 21 (2011) 4, pp. 434-457

Persistent link: https://www.econbiz.de/10009129585

Technik + Trends - Anlagentechnik - Internetbasierte Zusammenarbeit bei der Projektabwicklung -- ein Erfahrungsbericht

Erdmann, Burkhard; Evers, Wilhelm; Franke, Armin; … - In: Stahl und Eisen : Zeitschrift für die Herstellung und … 125 (2005) 8, pp. 43-50

Persistent link: https://www.econbiz.de/10006235006