default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Manuel Tamarit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j25]Juan Francisco Correcher
, Ramón Alvarez-Valdés, José Manuel Tamarit:
New exact methods for the time-invariant berth allocation and quay crane assignment problem. Eur. J. Oper. Res. 275(1): 80-92 (2019)- 2017
- [j24]Antonio Martinez-Sykora, Ramón Alvarez-Valdés, Julia A. Bennell, Rubén Ruiz, José Manuel Tamarit:
Matheuristics for the irregular bin packing problem with free rotations. Eur. J. Oper. Res. 258(2): 440-455 (2017) - 2016
- [j23]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
- [j22]Ramón Alvarez-Valdés, José Manuel Tamarit, Fulgencia Villa:
Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics. Comput. Oper. Res. 54: 1-11 (2015) - [j21]Pablo Frojan, Juan Francisco Correcher, Ramón Alvarez-Valdés, Gerasimos Koulouris, José Manuel Tamarit:
The continuous Berth Allocation Problem in a container terminal with multiple quays. Expert Syst. Appl. 42(21): 7356-7366 (2015) - [j20]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
- [j19]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
- [j18]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) - [j17]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
- [j16]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) - 2008
- [j15]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) - [j14]Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit, Fulgencia Villa:
GRASP and path relinking for project scheduling under partially renewable resources. Eur. J. Oper. Res. 189(3): 1153-1170 (2008) - [j13]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
- [j12]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) - [j11]Ramón Alvarez-Valdés, Rafael Martí, José Manuel Tamarit, Antonio Parajón:
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem. INFORMS J. Comput. 19(2): 261-272 (2007) - 2006
- [j10]Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit, Fulgencia Villa:
A scatter search algorithm for project scheduling under partially renewable resources. J. Heuristics 12(1-2): 95-113 (2006) - 2005
- [j9]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) - [j8]Ramón Alvarez-Valdés, Ariadna Fuertes, José Manuel Tamarit, Guillermo Giménez, Rafael Ramos:
A heuristic to schedule flexible job-shop in a glass factory. Eur. J. Oper. Res. 165(2): 525-534 (2005) - [j7]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) - [j6]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) - 2002
- [j5]Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit:
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. 29(7): 925-947 (2002) - [j4]Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit:
Design and implementation of a course scheduling system using Tabu Search. Eur. J. Oper. Res. 137(3): 512-523 (2002) - [j3]Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit:
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems. OR Spectr. 24(2): 179-192 (2002) - 2000
- [j2]Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit:
Assigning students to course sections using tabu search. Ann. Oper. Res. 96(1-4): 1-16 (2000)
1990 – 1999
- 1999
- [j1]Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit:
Labour scheduling at an airport refuelling installation. J. Oper. Res. Soc. 50(3): 211-218 (1999)
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-25 05:57 CEST 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:
