Eduardo Álvarez-Miranda

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