Narrow search
Showing 1 - 5 of 5
Cover Image
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k >= 3
Irnich, Stefan; Villeneuve, Daniel - In: INFORMS journal on computing : JOC 18 (2006) 3, pp. 391
Persistent link: https://www.econbiz.de/10007281134
Cover Image
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
Irnich, Stefan; Desaulniers, Guy; Desrosiers, Jacques; … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 297-314
Persistent link: https://www.econbiz.de/10008410688
Cover Image
Path-reduced costs for eliminating arcs in routing and scheduling
Irnich, Stefan; Desaulniers, Guy; Desrosiers, Jacques; … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 297-313
Persistent link: https://www.econbiz.de/10003979988
Cover Image
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
Cover Image
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