Similar Search Results

Dual inequalities for stabilized column generation revisited

Gschwind, Timo; Irnich, Stefan - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 175-194

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

Stabilized branch-and-price algorithms for vector packing problems

Heßler, Katrin; Gschwind, Timo; Irnich, Stefan - In: European journal of operational research : EJOR 271 (2018) 2, pp. 401-419

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

Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities

Gschwind, Timo; Irnich, Stefan - In: OR spectrum : quantitative approaches in management 39 (2017) 2, pp. 541-556

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

A branch-and-price framework for decomposing graphs into relaxed cliques

Gschwind, Timo; Irnich, Stefan; Furini, Fabio - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1070-1090

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

Contributions to exact approaches in combinatorial optimization

Gschwind, Timo - 2014

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the...

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

Advances in vehicle routing and logistics optimization : exact methods : editorial

Schneider, Michael; Gschwind, Timo; Vigo, Daniele - In: EURO journal on transportation and logistics 8 (2019) 2, pp. 117-118

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

Undirected postman problems with zigzagging option: a cutting-plane approach

Irnich, Stefan - In: Computers & operations research : and their … 35 (2008) 12, pp. 3998-4009

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

A new branch-and-price algorithm for the traveling tournament problem

Irnich, Stefan - In: European journal of operational research : EJOR 204 (2010) 2, pp. 218-228

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

Solving elementary shortest-path problems as mixed-integer programs

Drexl, Michael; Irnich, Stefan - In: OR spectrum : quantitative approaches in management 36 (2014) 2, pp. 281-296

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

The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem

Bode, Claudia; Irnich, Stefan - In: European journal of operational research : EJOR 238 (2014) 2, pp. 415-426

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