default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo Álvarez-Miranda
Publications
- 2025
[j33]Eduardo Álvarez-Miranda
, Rafael Epstein, Jordi Pereira, Markus Sinnl, Rodolfo Urrutia:
A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service. Comput. Oper. Res. 173: 106845 (2025)- 2024
- [i2]Eduardo Álvarez-Miranda, Markus Sinnl, Kübra Taninmis:
Competing for the most profitable tour: The orienteering interdiction game. CoRR abs/2407.02959 (2024) - 2021
- [j27]Eduardo Álvarez-Miranda, Markus Sinnl:
Exact and heuristic algorithms for the weighted total domination problem. Comput. Oper. Res. 127: 105157 (2021) - [j26]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): 1013-1029 (2021) - 2020
- [j24]Eduardo Álvarez-Miranda, Markus Sinnl:
A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. 284(2): 487-499 (2020) - 2019
- [j21]Eduardo Álvarez-Miranda, Markus Sinnl:
An exact solution framework for the multiple gradual cover location problem. Comput. Oper. Res. 108: 82-96 (2019) - [j19]Eduardo Álvarez-Miranda, Markus Sinnl:
A note on computational aspects of the Steiner traveling salesman problem. Int. Trans. Oper. Res. 26(4): 1396-1401 (2019) - [j18]Eduardo Álvarez-Miranda, Markus Sinnl:
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. Optim. Lett. 13(7): 1693-1709 (2019) - [i1]Eduardo Álvarez-Miranda, Markus Sinnl:
An exact solution framework for the multiple gradual cover location problem. CoRR abs/1909.04910 (2019) - 2018
- [j17]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265(2): 779-794 (2018) - [j15]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12(7): 1669-1681 (2018) - 2017
- [j14]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): 5-30 (2017) - [j11]Eduardo Álvarez-Miranda, Markus Sinnl:
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems. Comput. Oper. Res. 83: 13-27 (2017) - [j10]Eduardo Álvarez-Miranda, Markus Sinnl:
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. Comput. Oper. Res. 87: 63-82 (2017) - [j9]Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258(3): 887-901 (2017) - 2016
- [c7]Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl:
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. CPAIOR 2016: 406-420
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-12 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
