Similar Search Results

Two-phase branch-and-cut for the mixed capacitated general routing problem

Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; … - In: European Journal of Operational Research 243 (2015) 1, pp. 17-29

The Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the...

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

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

Formulations for an inventory routing problem

Archetti, Claudia; Bianchessi, Nicola; Irnich, Stefan; … - In: International transactions in operational research : … 21 (2014) 3, pp. 353-374

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

Two-phase branch-and-cut for the mixed capacitated general routing problem

Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; … - In: European journal of operational research : EJOR 243 (2015) 1, pp. 17-29

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

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

Branch-and-price-and-cut for a service network design and hub location problem

Rothenbächer, Ann-Kathrin; Drexl, Michael; Irnich, Stefan - In: European journal of operational research : EJOR 255 (2016) 3, pp. 935-947

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

A new compact formulation for the discrete p-dispersion problem

Sayah, David; Irnich, Stefan - In: European journal of operational research : EJOR 256 (2017) 1, pp. 62-67

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

Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models

Desaulniers, Guy; Gschwind, Timo; Irnich, Stefan - In: Transportation science : a journal of the Institute for … 54 (2020) 5, pp. 1170-1188

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

Resource-window reduction by reduced costs in path-based formulations for routing and scheduling problems

Bianchessi, Nicola; Gschwind, Timo; Irnich, Stefan - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 1, pp. 224-244

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