Eduardo Álvarez-Miranda

Available identifiers

zbMath Open alvarez-miranda.eduardoMaRDI QIDQ296862

List of research outcomes

Publication	Date of Publication	Type
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem	2024-07-08	Paper
A note on computational aspects of the Steiner traveling salesman problem	2023-11-16	Paper
Analysis of the simple assembly line balancing problem complexity	2023-09-13	Paper
The generalized reserve set covering problem with connectivity and buffer requirements	2021-06-03	Paper
Exact and heuristic algorithms for the weighted total domination problem	2021-05-21	Paper
Multicriteria saliency detection: a (exact) robust network design approach	2020-05-11	Paper
A branch-and-cut algorithm for the maximum covering cycle problem	2020-01-20	Paper
Mixed-integer programming approaches for the tree \(t^*\)-spanner problem	2019-10-18	Paper
Exact and heuristic algorithms for the weighted total domination problem	2019-10-08	Paper
An exact solution framework for the multiple gradual cover location problem	2019-07-08	Paper
On the complexity of assembly line balancing problems	2019-07-08	Paper
An exact solution framework for the minimum cost dominating tree problem	2018-10-23	Paper
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems	2018-07-11	Paper
Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach	2018-07-11	Paper
A relax-and-cut framework for large-scale maximum weight connected subgraph problems	2018-07-11	Paper
Solving minimum-cost shared arborescence problems	2018-05-25	Paper
A multicriteria optimization model for sustainable forest management under climate change uncertainty: an application in Portugal	2018-04-23	Paper
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death	2018-02-26	Paper
Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems	2017-11-23	Paper
On exact solutions for the minmax regret spanning tree problem	2016-11-10	Paper
Optimal Upgrading Schemes for Effective Shortest Paths in Networks	2016-06-27	Paper
Single-commodity robust network design problem: complexity, instances and heuristic solutions	2016-06-23	Paper
Vulnerability Assessment of Spatial Networks: Models and Solutions	2015-10-16	Paper
The Recoverable Robust Two-Level Network Design Problem	2015-09-11	Paper
Exact approaches for solving robust prize-collecting Steiner tree problems	2015-07-28	Paper
The Maximum Weight Connected Subgraph Problem	2015-07-22	Paper
Risk models for the prize collecting Steiner tree problems with interval data	2014-08-29	Paper
A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems	2014-03-24	Paper
The Rooted Maximum Node-Weight Connected Subgraph Problem	2013-06-04	Paper
Minmax regret combinatorial optimization problems: an Algorithmic Perspective	2013-04-29	Paper
Models and Algorithms for Robust Network Design with Several Traffic Scenarios	2012-11-02	Paper
On a Class of Interval Data Minmax Regret CO Problems	2011-04-07	Paper
Deterministic risk control for cost-effective network connections	2011-01-28	Paper
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data	2010-07-20	Paper

Research outcomes over time

This page was built for person: Eduardo Álvarez-Miranda