Eduardo Álvarez-Miranda

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 29

Top Venues

University of Bologna, Italy (PHD)

Education History

University of Bologna, Italy

PHD

Publications

Rajkumar Verma, Eduardo Álvarez-Miranda
Multiple-attribute group decision-making approach using power aggregation operators with CRITIC-WASPAS method under 2-dimensional linguistic intuitionistic fuzzy framework. Appl. Soft Comput. 157 (2024)
Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis
Competing for the most profitable tour: The orienteering interdiction game. CoRR (2024)
Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. Comput. Oper. Res. 166 (2024)
Rajkumar Verma, Eduardo Álvarez-Miranda
Group decision-making method based on advanced aggregation operators with entropy and divergence measures under 2-tuple linguistic Pythagorean fuzzy environment. Expert Syst. Appl. 231 (2023)
Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà
Analysis of the simple assembly line balancing problem complexity. Comput. Oper. Res. 159 (2023)
Eduardo Álvarez-Miranda, Jordi Pereira, Camila Vargas, Mariona Vilà
Variable-depth local search heuristic for assembly line balancing problems. Int. J. Prod. Res. 61 (9) (2023)
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. Eur. J. Oper. Res. 289 (3) (2021)
Eduardo Álvarez-Miranda, Markus Sinnl
Exact and heuristic algorithms for the weighted total domination problem. Comput. Oper. Res. 127 (2021)
Eduardo Álvarez-Miranda, Sebastián Chace, Jordi Pereira
Assembly line balancing with parallel workstations. Int. J. Prod. Res. 59 (21) (2021)
Eduardo Álvarez-Miranda, Markus Sinnl
A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. 284 (2) (2020)
David Revillot-Narváez, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda
Optimising the storage assignment and order-picking for the compact drive-in storage system. Int. J. Prod. Res. 58 (22) (2020)
Eduardo Álvarez-Miranda, John Díaz-Guerrero
Multicriteria saliency detection: a (exact) robust network design approach. Ann. Oper. Res. 286 (1) (2020)
Eduardo Álvarez-Miranda, Markus Sinnl
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. Optim. Lett. 13 (7) (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
An exact solution framework for the multiple gradual cover location problem. Comput. Oper. Res. 108 (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
A note on computational aspects of the Steiner traveling salesman problem. Int. Trans. Oper. Res. 26 (4) (2019)
Eduardo Álvarez-Miranda, Markus Sinnl
An exact solution framework for the multiple gradual cover location problem. CoRR (2019)
Eduardo Álvarez-Miranda, Jordi Pereira
On the complexity of assembly line balancing problems. Comput. Oper. Res. 108 (2019)
Eduardo Álvarez-Miranda, Jordi Garcia-Gonzalo, Felipe Ulloa-Fierro, Andrés Weintraub, Susana Barreiro
A multicriteria optimization model for sustainable forest management under climate change uncertainty: An application in Portugal. Eur. J. Oper. Res. 269 (1) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12 (7) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265 (2) (2018)
Celso Herrera-Cáceres, Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar
Optimization of the harvest planning in the olive oil production: A case study in Chile. Comput. Electron. Agric. 141 (2017)
Eduardo Álvarez-Miranda, Hesso Farhan, Martin Luipersbeck, Markus Sinnl
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. Ann. Oper. Res. 258 (1) (2017)
Eduardo Álvarez-Miranda, Markus Sinnl
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. Comput. Oper. Res. 87 (2017)
Eduardo Álvarez-Miranda, Markus Sinnl
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. Comput. Oper. Res. 83 (2017)
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258 (3) (2017)
Eduardo Álvarez-Miranda, Jordi Pereira
Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. Comput. Oper. Res. 81 (2017)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. CPAIOR (2016)
Eduardo Álvarez-Miranda
Networks, uncertainty, applications and a crusade for optimality. 4OR 13 (2) (2015)
Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth
The Recoverable Robust Two-Level Network Design Problem. INFORMS J. Comput. 27 (1) (2015)
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce
Vulnerability Assessment of Spatial Networks: Models and Solutions. ISCO (2014)
Francisco Pérez-Galarce, Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Paolo Toth
On exact solutions for the Minmax Regret Spanning Tree problem. Comput. Oper. Res. 47 (2014)
Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238 (3) (2014)
Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel
The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR (2013)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11 (4) (2013)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
Exact approaches for solving robust prize-collecting Steiner tree problems. Eur. J. Oper. Res. 229 (3) (2013)
Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO (2012)
Eduardo Álvarez-Miranda, Xujin Chen, Jie Hu, Xiaodong Hu, Alfredo Candia-Véjar
Deterministic risk control for cost-effective network connections. Theor. Comput. Sci. 412 (3) (2011)
Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth
Exact solutions for the robust prize-collecting steiner tree problem. ICUMT (2011)
Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan
Minmax regret combinatorial optimization problems: an Algorithmic Perspective. RAIRO Oper. Res. 45 (2) (2011)
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM (2010)
Alfredo Candia-Véjar, Eduardo Álvarez-Miranda
On a Class of Interval Data Minmax Regret CO Problems. OR (2007)

Eduardo Álvarez-Miranda.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eduardo Álvarez-Miranda