Similar Search Results

On exact solutions for the Minimax Regret Spanning Tree problem

Pérez-Galarce, Francisco; Álvarez-Miranda, Eduardo; … - In: Computers & operations research : and their … 47 (2014), pp. 114-122

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

General Polyhedral Approximation of two-stage robust linear programming for budgeted uncertainty

Grunau, Lukas; Niemann, Tim; Stiller, Sebastian - In: Computers & operations research : an international journal 179 (2025), pp. 1-10

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

Delay-resistant robust vehicle routing with heterogeneous time windows

Metz, Lukas; Mutzel, Petra; Niemann, Tim; Schürmann, Lukas - In: Computers & operations research : an international journal 164 (2024), pp. 1-15

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

Exact approaches for solving robust prize-collecting Steiner tree problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo - In: European Journal of Operational Research 229 (2013) 3, pp. 599-612

In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link...

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