default search action
Francisco Parreño
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Marta Cildoz, Pedro M. Mateo, Maria Teresa Alonso, Francisco Parreño, Ramón Alvarez-Valdés, Fermín Mallor:
The optimal container selection problem for parts transportation in the automotive sector. Expert Syst. Appl. 247: 123321 (2024) - [j23]Consuelo Parreño-Torres, Miguel Reula, Ramón Alvarez-Valdés, Francisco Parreño:
Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model. Expert Syst. Appl. 249: 123728 (2024) - [j22]Rafael Martí, Francisco Parreño, Jorge Mortes:
Mathematical models and solving methods for diversity and equity optimization. J. Heuristics 30(5): 291-323 (2024) - 2023
- [j21]Iván Giménez Palacios, Maria Teresa Alonso, Ramón Alvarez-Valdés, Francisco Parreño:
Multi-container loading problems with multidrop and split delivery conditions. Comput. Ind. Eng. 175: 108844 (2023) - [j20]Francisco Parreño, Consuelo Parreño-Torres, Ramón Alvarez-Valdés:
A matheuristic algorithm for the maintenance planning problem at an electricity transmission system operator. Expert Syst. Appl. 230: 120583 (2023) - 2022
- [j19]Maria Teresa Alonso, Antonio Martinez-Sykora, Ramón Alvarez-Valdés, Francisco Parreño:
The pallet-loading vehicle routing problem with stability constraints. Eur. J. Oper. Res. 302(3): 860-873 (2022) - [j18]Consuelo Parreño-Torres, Ramón Alvarez-Valdés, Francisco Parreño:
A beam search algorithm for minimizing crane times in premarshalling problems. Eur. J. Oper. Res. 302(3): 1063-1078 (2022) - 2021
- [j17]Francisco Parreño, Ramón Alvarez-Valdés, Rafael Martí:
Measuring diversity. A review and an empirical analysis. Eur. J. Oper. Res. 289(2): 515-532 (2021) - 2020
- [j16]Maria Teresa Alonso, Ramón Alvarez-Valdés, Francisco Parreño:
A GRASP algorithm for multi container loading problems with practical constraints. 4OR 18(1): 49-72 (2020) - [j15]Francisco Parreño, Maria Teresa Alonso, Ramón Alvarez-Valdés:
Solving a large cutting problem in the glass manufacturing industry. Eur. J. Oper. Res. 287(1): 378-388 (2020)
2010 – 2019
- 2019
- [j14]Maria Teresa Alonso, Ramón Alvarez-Valdés, Manuel Iori, Francisco Parreño:
Mathematical models for Multi Container Loading Problems with practical constraints. Comput. Ind. Eng. 127: 722-733 (2019) - 2017
- [j13]Juan Francisco Correcher, Maria Teresa Alonso, Francisco Parreño, Ramón Alvarez-Valdés:
Solving a large multicontainer loading problem in the car manufacturing industry. Comput. Oper. Res. 82: 139-152 (2017) - 2016
- [j12]Maria Teresa Alonso, Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
Determining the best shipper sizes for sending products to customers. Int. Trans. Oper. Res. 23(1-2): 265-285 (2016) - 2015
- [j11]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectr. 37(1): 49-74 (2015) - 2013
- [j10]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Comput. Oper. Res. 40(12): 3081-3090 (2013) - 2010
- [j9]Francisco Parreño, Ramón Alvarez-Valdés, José Fernando Oliveira, José Manuel Tamarit:
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing. Ann. Oper. Res. 179(1): 203-220 (2010) - [j8]Francisco Parreño, Ramón Alvarez-Valdés, José Fernando Oliveira, José Manuel Tamarit:
Neighborhood structures for the container loading problem: a VNS implementation. J. Heuristics 16(1): 1-22 (2010)
2000 – 2009
- 2009
- [j7]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A branch and bound algorithm for the strip packing problem. OR Spectr. 31(2): 431-459 (2009) - [c1]Ricardo García-Ródenas, Máximo Almodóvar, Francisco Parreño:
Heuristic Algorithm for Coordination in Public Transport under Disruptions. EvoWorkshops 2009: 808-817 - 2008
- [j6]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35(4): 1065-1083 (2008) - [j5]Francisco Parreño, Ramón Alvarez-Valdés, José Manuel Tamarit, José Fernando Oliveira:
A Maximal-Space Algorithm for the Container Loading Problem. INFORMS J. Comput. 20(3): 412-422 (2008) - 2007
- [j4]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 183(3): 1167-1182 (2007) - 2005
- [j3]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A branch-and-cut algorithm for the pallet loading problem. Comput. Oper. Res. 32: 3007-3029 (2005) - [j2]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J. Oper. Res. Soc. 56(4): 414-425 (2005) - [j1]Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A tabu search algorithm for the pallet loading problem. OR Spectr. 27(1): 43-61 (2005)
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-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint