Similar Search Results

Exact approaches for solving robust prize-collecting Steiner tree problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo - In: European journal of operational research : EJOR 229 (2013) 3, pp. 599-612

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

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo - In: 4OR : a quarterly journal of operations research 11 (2013) 4, pp. 349-360

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

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

The recoverable robust two-level network design problem

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Raghavan, S.; … - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 1-19

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

Exact approaches for solving robust prize-collecting Steiner tree problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo - In: European journal of operational research : EJOR 229 (2013) 3, pp. 599-612

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

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