Francisco Parreño

Orcid: 0000-0002-4629-3430

According to our database1, Francisco Parreño authored at least 25 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mathematical models and solving methods for diversity and equity optimization.
J. Heuristics, December, 2024

Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model.
Expert Syst. Appl., 2024

The optimal container selection problem for parts transportation in the automotive sector.
Expert Syst. Appl., 2024

2023
A matheuristic algorithm for the maintenance planning problem at an electricity transmission system operator.
Expert Syst. Appl., November, 2023

Multi-container loading problems with multidrop and split delivery conditions.
Comput. Ind. Eng., 2023

2022
A beam search algorithm for minimizing crane times in premarshalling problems.
Eur. J. Oper. Res., 2022

The pallet-loading vehicle routing problem with stability constraints.
Eur. J. Oper. Res., 2022

2021
Measuring diversity. A review and an empirical analysis.
Eur. J. Oper. Res., 2021

2020
Solving a large cutting problem in the glass manufacturing industry.
Eur. J. Oper. Res., 2020

A GRASP algorithm for multi container loading problems with practical constraints.
4OR, 2020

2019
Mathematical models for Multi Container Loading Problems with practical constraints.
Comput. Ind. Eng., 2019

2017
Solving a large multicontainer loading problem in the car manufacturing industry.
Comput. Oper. Res., 2017

2016
Determining the best shipper sizes for sending products to customers.
Int. Trans. Oper. Res., 2016

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

2013
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems.
Comput. Oper. Res., 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.
Ann. Oper. Res., 2010

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

Heuristic Algorithm for Coordination in Public Transport under Disruptions.
Proceedings of the Applications of Evolutionary Computing, 2009

2008
A Maximal-Space Algorithm for the Container Loading Problem.
INFORMS J. Comput., 2008

Reactive GRASP for the strip-packing problem.
Comput. Oper. Res., 2008

2007
A tabu search algorithm for a two-dimensional non-guillotine cutting problem.
Eur. J. Oper. Res., 2007

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

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems.
J. Oper. Res. Soc., 2005

A branch-and-cut algorithm for the pallet loading problem.
Comput. Oper. Res., 2005


  Loading...