default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Perea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Juan Francisco Correcher
, Federico Perea, Ramón Alvarez-Valdés:
The berth allocation and quay crane assignment problem with crane travel and setup times. Comput. Oper. Res. 162: 106468 (2024)- [j20]Lorena Linares, Rafael Vázquez, Federico Perea, Jorge Galán-Vioque:
A Mixed Integer Linear Programming Model for Resolution of the Antenna-Satellite Scheduling Problem. IEEE Trans. Aerosp. Electron. Syst. 60(1): 463-473 (2024) - 2023
- [j19]Juan C. Yepes-Borrero, Federico Perea, Fulgencia Villa, Eva Vallada:
Flowshop with additional resources during setups: Mathematical models and a GRASP algorithm. Comput. Oper. Res. 154: 106192 (2023) - [j18]Axel Lopez-Esteve, Federico Perea, Juan C. Yepes-Borrero:
GRASP algorithms for the unrelated parallel machines scheduling problem with additional resources during processing and setups. Int. J. Prod. Res. 61(17): 6013-6029 (2023) - 2022
- [j17]Diana L. Huerta-Muñoz, Claudia Archetti, Elena Fernández, Federico Perea:
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. Comput. Oper. Res. 141: 105662 (2022) - 2021
- [j16]Juan C. Yepes-Borrero, Federico Perea, Rubén Ruiz, Fulgencia Villa:
Bi-objective parallel machine scheduling with additional resources during setups. Eur. J. Oper. Res. 292(2): 443-455 (2021) - [e1]Matthias Müller-Hannemann, Federico Perea:
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference). OASIcs 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-213-6 [contents] - 2020
- [j15]Juan C. Yepes-Borrero, Fulgencia Villa, Federico Perea, Juan Pablo Caballero-Villalobos:
GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Expert Syst. Appl. 141 (2020)
2010 – 2019
- 2019
- [j14]Luis Fanjul-Peyro, Rubén Ruiz, Federico Perea:
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Comput. Oper. Res. 101: 173-182 (2019) - [j13]Federico Perea, Justo Puerto:
A heuristic procedure for computing the nucleolus. Comput. Oper. Res. 112 (2019) - 2017
- [j12]Luis Fanjul-Peyro, Federico Perea, Rubén Ruiz:
Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur. J. Oper. Res. 260(2): 482-493 (2017) - [j11]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
The railway line frequency and size setting problem. Public Transp. 9(1-2): 33-53 (2017) - 2015
- [j10]Federico Perea, Rafael Vázquez, Jorge Galán-Vioque:
Swath-acquisition planning in multiple-satellite missions: an exact and heuristic approach. IEEE Trans. Aerosp. Electron. Syst. 51(3): 1717-1725 (2015) - 2014
- [c6]Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea:
Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints. ATMOS 2014: 107-121 - [i1]Justo Puerto, Federico Perea:
On two solution concepts in a class of multicriteria games. CoRR abs/1405.3176 (2014) - 2013
- [j9]Justo Puerto, Federico Perea:
Finding the nucleolus of any n-person cooperative game by a single linear program. Comput. Oper. Res. 40(10): 2308-2313 (2013) - [j8]Federico Perea, Justo Puerto:
Revisiting a game theoretic framework for the robust railway network design against intentional attacks. Eur. J. Oper. Res. 226(2): 286-292 (2013) - [j7]Bosco García-Archilla, Antonio J. Lozano, Juan A. Mesa, Federico Perea:
GRASP algorithms for the robust railway network design problem. J. Heuristics 19(2): 399-422 (2013) - 2012
- [j6]Justo Puerto, Arie Tamir, Federico Perea:
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discret. Appl. Math. 160(7-8): 970-979 (2012) - [j5]Federico Perea, Justo Puerto, Francisco R. Fernández:
Avoiding unfairness of Owen allocations in linear production processes. Eur. J. Oper. Res. 220(1): 125-131 (2012) - [c5]Kostanca Katragjini, Federico Perea, Rubén Ruiz:
Efficient Waste Collection by Means of Assignment Problems. ICORES 2012: 283-292 - 2011
- [j4]Justo Puerto, Arie Tamir, Federico Perea:
A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. 214(2): 317-330 (2011) - [j3]Federico Perea, Huub W. de Waard:
Greedy and K -Greedy Algorithms for Multidimensional Data Association. IEEE Trans. Aerosp. Electron. Syst. 47(3): 1915-1925 (2011) - 2010
- [c4]Francisco R. Fernández, Federico Perea, Justo Puerto:
Avoiding unfairness of Owen solutions in linear production games. BQGT 2010: 77:1-77:7 - [c3]Justo Puerto, Arie Tamir, Federico Perea:
Some new cooperative coverage facility location games. BQGT 2010: 78:1-78:3
2000 – 2009
- 2009
- [j2]Federico Perea, Justo Puerto, Francisco R. Fernández:
Modeling cooperation on a class of distribution problems. Eur. J. Oper. Res. 198(3): 726-733 (2009) - [p1]Ángel Marín, Juan A. Mesa, Federico Perea:
Integrating Robust Railway Network Design and Line Planning under Failures. Robust and Online Large-Scale Optimization 2009: 273-292 - 2007
- [j1]Federico Perea, Justo Puerto:
Dynamic programming analysis of the TV game "Who wants to be a millionaire?". Eur. J. Oper. Res. 183(2): 805-811 (2007) - [c2]Ricardo García, Ángel Marín, Juan A. Mesa, Federico Perea, Doroteo Verastegui:
A new concept of robustness. ATMOS 2007 - 2006
- [c1]Federico Perea, Huub W. de Waard:
A new class of Heuristic Polynomial Time Algorithms to solve the Multidimensional Assignment Problem. FUSION 2006: 1-8
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 2025-01-21 00:16 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:
