default search action
Silvia Lorenzo-Freire
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Luisa Carpente, Ana Cerdeira-Pena, Silvia Lorenzo-Freire, Ángeles Saavedra Places:
Optimization in Sanger Sequencing. CoRR abs/2401.11854 (2024) - 2023
- [j14]Isabel Méndez-Fernández, Silvia Lorenzo-Freire, Ángel Manuel González-Rueda:
An Adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks. Comput. Oper. Res. 159: 106351 (2023) - [j13]Silvia Lorenzo-Freire, Adrián González-Maestro, José María Alonso-Meijide:
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups. Discret. Appl. Math. 338: 113-124 (2023)
2010 – 2019
- 2019
- [j12]Luisa Carpente, Ana Cerdeira-Pena, Silvia Lorenzo-Freire, Ángeles Saavedra Places:
Optimization in Sanger sequencing. Comput. Oper. Res. 109: 250-262 (2019) - [j11]Silvia Lorenzo-Freire:
On the Owen Value and the Property of Balanced Contributions Within Unions. J. Optim. Theory Appl. 183(2): 757-762 (2019) - 2016
- [j10]Silvia Lorenzo-Freire:
On new characterizations of the Owen value. Oper. Res. Lett. 44(4): 491-494 (2016) - 2011
- [j9]Gustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire:
A generalization of obligation rules for minimum cost spanning tree problems. Eur. J. Oper. Res. 211(1): 122-129 (2011) - [j8]Gustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire:
New characterizations of the constrained equal awards rule in multi-issue allocation situations. Math. Methods Oper. Res. 74(3): 311-325 (2011) - 2010
- [j7]Gustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire:
A characterization of the proportional rule in multi-issue allocation situations. Oper. Res. Lett. 38(1): 17-19 (2010) - [j6]Gustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire:
The family of cost monotonic and cost additive rules in minimum cost spanning tree problems. Soc. Choice Welf. 34(4): 695-710 (2010)
2000 – 2009
- 2009
- [j5]Leticia Lorenzo, Silvia Lorenzo-Freire:
A characterization of Kruskal sharing rules for minimum cost spanning tree problems. Int. J. Game Theory 38(1): 107-126 (2009) - 2008
- [j4]Gustavo Bergantiños, Silvia Lorenzo-Freire:
"Optimistic" weighted Shapley rules in minimum cost spanning tree problems. Eur. J. Oper. Res. 185(1): 289-298 (2008) - [j3]José M. Alonso-Meijide, Balbina Casas-Méndez, Manfred J. Holler, Silvia Lorenzo-Freire:
Computing power indices: Multilinear extensions and new characterizations. Eur. J. Oper. Res. 188(2): 540-554 (2008) - 2007
- [j2]Silvia Lorenzo-Freire, José M. Alonso-Meijide, Balbina Casas-Méndez, M. Gloria Fiestras-Janeiro:
Characterizations of the Deegan-Packel and Johnston power indices. Eur. J. Oper. Res. 177(1): 431-444 (2007) - [j1]Silvia Lorenzo-Freire, José M. Alonso-Meijide, Balbina Casas-Méndez, Ruud Hendrickx:
Balanced contributions for TU games with awards and applications. Eur. J. Oper. Res. 182(2): 958-964 (2007)
Coauthor Index
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 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint