A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service - Eduardo Álvarez-Miranda; Rafael Epstein; Jordi Pereira; Markus Sinnl; Rodolfo Urrutia (Comput. Oper. Res., 2025)

Multiple-attribute group decision-making approach using power aggregation operators with CRITIC-WASPAS method under 2-dimensional linguistic intuitionistic fuzzy framework - Rajkumar Verma; Eduardo Álvarez-Miranda (Appl. Soft Comput., 2024)

A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem - Eduardo Álvarez-Miranda; Jordi Pereira; Mariona Vilà (Comput. Oper. Res., 2024)

Competing for the most profitable tour: The orienteering interdiction game - Eduardo Álvarez-Miranda; Markus Sinnl; Kübra Taninmis (CoRR, 2024)

Analysis of the simple assembly line balancing problem complexity - Eduardo Álvarez-Miranda; Jordi Pereira; Mariona Vilà (Comput. Oper. Res., 2023)

Group decision-making method based on advanced aggregation operators with entropy and divergence measures under 2-tuple linguistic Pythagorean fuzzy environment - Rajkumar Verma; Eduardo Álvarez-Miranda (Expert Syst. Appl., 2023)

Variable-depth local search heuristic for assembly line balancing problems - Eduardo Álvarez-Miranda; Jordi Pereira; Camila Vargas; Mariona Vilà (Int. J. Prod. Res., 2023)

Exact and heuristic algorithms for the weighted total domination problem - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2021)

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements - Eduardo Álvarez-Miranda; Marcos Goycoolea; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2021)

Assembly line balancing with parallel workstations - Eduardo Álvarez-Miranda; Sebastián Chace; Jordi Pereira (Int. J. Prod. Res., 2021)

A branch-and-cut algorithm for the maximum covering cycle problem - Eduardo Álvarez-Miranda; Markus Sinnl (Ann. Oper. Res., 2020)

Multicriteria saliency detection: a (exact) robust network design approach - Eduardo Álvarez-Miranda; John Díaz-Guerrero (Ann. Oper. Res., 2020)

Optimising the storage assignment and order-picking for the compact drive-in storage system - David Revillot-Narváez; Francisco Pérez-Galarce; Eduardo Álvarez-Miranda (Int. J. Prod. Res., 2020)

An exact solution framework for the multiple gradual cover location problem - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2019)

On the complexity of assembly line balancing problems - Eduardo Álvarez-Miranda; Jordi Pereira (Comput. Oper. Res., 2019)

A note on computational aspects of the Steiner traveling salesman problem - Eduardo Álvarez-Miranda; Markus Sinnl (Int. Trans. Oper. Res., 2019)

Mixed-integer programming approaches for the tree t^* t \(_*\) -spanner problem - Eduardo Álvarez-Miranda; Markus Sinnl (Optim. Lett., 2019)

An exact solution framework for the multiple gradual cover location problem - Eduardo Álvarez-Miranda; Markus Sinnl (CoRR, 2019)

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2018)

A multicriteria optimization model for sustainable forest management under climate change uncertainty: An application in Portugal - Eduardo Álvarez-Miranda; Jordi Garcia-Gonzalo; Felipe Ulloa-Fierro; Andrés Weintraub; Susana Barreiro (Eur. J. Oper. Res., 2018)

An exact solution framework for the minimum cost dominating tree problem - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Optim. Lett., 2018)

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death - Eduardo Álvarez-Miranda; Hesso Farhan; Martin Luipersbeck; Markus Sinnl (Ann. Oper. Res., 2017)

Optimization of the harvest planning in the olive oil production: A case study in Chile - Celso Herrera-Cáceres; Francisco Pérez-Galarce; Eduardo Álvarez-Miranda; Alfredo Candia-Véjar (Comput. Electron. Agric., 2017)

Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach - Eduardo Álvarez-Miranda; Jordi Pereira (Comput. Oper. Res., 2017)

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2017)

A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems - Eduardo Álvarez-Miranda; Markus Sinnl (Comput. Oper. Res., 2017)

Solving minimum-cost shared arborescence problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2017)

Optimal Upgrading Schemes for Effective Shortest Paths in Networks - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Integration of AI and OR Techniques in Constraint Programming - 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings, 2016)

Networks, uncertainty, applications and a crusade for optimality - Eduardo Álvarez-Miranda (4OR, 2015)

The Recoverable Robust Two-Level Network Design Problem - Eduardo Álvarez-Miranda; Ivana Ljubic; S. Raghavan; Paolo Toth (INFORMS J. Comput., 2015)

Networks, Uncertainty, Applications and a Crusade for Optimality - Eduardo Álvarez-Miranda (University of Bologna, Italy, 2014)

On exact solutions for the Minmax Regret Spanning Tree problem - Francisco Pérez-Galarce; Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Paolo Toth (Comput. Oper. Res., 2014)

Single-commodity robust network design problem: Complexity, instances and heuristic solutions - Eduardo Álvarez-Miranda; Valentina Cacchiani; Andrea Lodi; Tiziano Parriani; Daniel R. Schmidt (Eur. J. Oper. Res., 2014)

Vulnerability Assessment of Spatial Networks: Models and Solutions - Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Emilio Carrizosa; Francisco Pérez-Galarce (Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, 2014)

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (4OR, 2013)

Exact approaches for solving robust prize-collecting Steiner tree problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (Eur. J. Oper. Res., 2013)

The Rooted Maximum Node-Weight Connected Subgraph Problem - Eduardo Álvarez-Miranda; Ivana Ljubic; Petra Mutzel (Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings, 2013)

Models and Algorithms for Robust Network Design with Several Traffic Scenarios - Eduardo Álvarez-Miranda; Valentina Cacchiani; Tim Dorneth; Michael Jünger; Frauke Liers; Andrea Lodi; Tiziano Parriani; Daniel R. Schmidt (Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, 2012)

Minmax regret combinatorial optimization problems: an Algorithmic Perspective - Alfredo Candia-Véjar; Eduardo Álvarez-Miranda; Nelson Maculan (RAIRO Oper. Res., 2011)

Deterministic risk control for cost-effective network connections - Eduardo Álvarez-Miranda; Xujin Chen; Jie Hu; Xiaodong Hu; Alfredo Candia-Véjar (Theor. Comput. Sci., 2011)

Exact solutions for the robust prize-collecting steiner tree problem - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011, Budapest, Hungary, October 5-7, 2011, 2011)

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data - Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Xujin Chen; Xiaodong Hu; Bi Li (Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings, 2010)

On a Class of Interval Data Minmax Regret CO Problems - Alfredo Candia-Véjar; Eduardo Álvarez-Miranda (Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007, 2007)