Lagrangian and branch-and-cut approaches for upgrading spanning tree problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2017)

An exact solution framework for the multiple gradual cover location problem

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2019)

On the complexity of assembly line balancing problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2019)

Designing and constructing networks under uncertainty in the construction stage : definition and exact algorithmic approach

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2017)

Exact and heuristic algorithms for the weighted total domination problem

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2021)

A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2017)

An exact approach for the robust assembly line balancing problem

von Pereira, Jordi
Veröffentlicht in Omega (2018)

A branch-and-cut algorithm for the maximum covering cycle problem

von Álvarez-Miranda, Eduardo
Veröffentlicht in Decomposition methods for hard optimization problems (2020)

On a class of interval data minimax regret CO problems

von Candia-Véjar, Alfredo
Veröffentlicht in Operations research proceedings 2007 (2008)

Multicriteria saliency detection : a (exact) robust network design approach

von Álvarez-Miranda, Eduardo
Veröffentlicht in Latin-Iberian-American Conference on Operations Research (18. : 2016 : Santiago) Operations research and systems (2020)

Exact approaches for solving robust prize-collecting Steiner tree problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in European journal of operational research (2013)

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

von Álvarez-Miranda, Eduardo
Veröffentlicht in 4OR (2013)

Analysis of the simple assembly line balancing problem complexity

von Álvarez-Miranda, Eduardo
Veröffentlicht in Computers & operations research (2023)

Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in European journal of operational research (12018)

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements

von Álvarez-Miranda, Eduardo
Veröffentlicht in European journal of operational research (2021)

The recoverable robust two-level network design problem

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2015)

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death

von Álvarez-Miranda, Eduardo
Veröffentlicht in Operations research in neuroscience (2017)

Solving minimum-cost shared arborescence problems

von Álvarez-Miranda, Eduardo
Veröffentlicht in European journal of operational research (12017)

On exact solutions for the Minimax Regret Spanning Tree problem

Veröffentlicht in Computers & operations research (2014)

Single-commodity robust network design problem : complexity, instances and heuristics solutions

Veröffentlicht in European journal of operational research (2014)