Ramón Alvarez-Valdés

According to our database1, Ramón Alvarez-Valdés authored at least 32 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A branch and bound approach for large pre-marshalling problems.
European Journal of Operational Research, 2019

Integer programming models for the pre-marshalling problem.
European Journal of Operational Research, 2019

The berth allocation problem in terminals with irregular layouts.
European Journal of Operational Research, 2019

New exact methods for the time-invariant berth allocation and quay crane assignment problem.
European Journal of Operational Research, 2019

2018
Cutting and Packing.
Proceedings of the Handbook of Heuristics., 2018

2017
A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem.
Expert Syst. Appl., 2017

Matheuristics for the irregular bin packing problem with free rotations.
European Journal of Operational Research, 2017

Solving a large multicontainer loading problem in the car manufacturing industry.
Computers & OR, 2017

2016
Preface to the Special Issue on Cutting and Packing.
ITOR, 2016

Determining the best shipper sizes for sending products to customers.
ITOR, 2016

A decomposition approach to dual shuttle automated storage and retrieval systems.
Computers & Industrial Engineering, 2016

2015
Lower bounds for three-dimensional multiple-bin-size bin packing problems.
OR Spectrum, 2015

The continuous Berth Allocation Problem in a container terminal with multiple quays.
Expert Syst. Appl., 2015

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics.
Computers & OR, 2015

2013
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems.
Computers & OR, 2013

2010
Neighborhood structures for the container loading problem: a VNS implementation.
J. Heuristics, 2010

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing.
Annals OR, 2010

2009
A branch and bound algorithm for the strip packing problem.
OR Spectrum, 2009

2008
A Maximal-Space Algorithm for the Container Loading Problem.
INFORMS Journal on Computing, 2008

GRASP and path relinking for project scheduling under partially renewable resources.
European Journal of Operational Research, 2008

Reactive GRASP for the strip-packing problem.
Computers & OR, 2008

2007
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.
INFORMS Journal on Computing, 2007

A tabu search algorithm for a two-dimensional non-guillotine cutting problem.
European Journal of Operational Research, 2007

2006
A scatter search algorithm for project scheduling under partially renewable resources.
J. Heuristics, 2006

2005
A tabu search algorithm for the pallet loading problem.
OR Spectrum, 2005

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems.
JORS, 2005

A heuristic to schedule flexible job-shop in a glass factory.
European Journal of Operational Research, 2005

A branch-and-cut algorithm for the pallet loading problem.
Computers & OR, 2005

2002
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems.
OR Spectrum, 2002

Design and implementation of a course scheduling system using Tabu Search.
European Journal of Operational Research, 2002

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems.
Computers & OR, 2002

2000
Assigning students to course sections using tabu search.
Annals OR, 2000


  Loading...