Federico Alonso-Pecina

According to our database, Federico Alonso-Pecina authored at least 7 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Iterated local search for the label printing problem.

Federico Alonso-Pecina, David Romero, Marco Antonio Cruz-Chávez

J. Oper. Res. Soc., January, 2024

2022

Two heuristics for the label printing problem.

Federico Alonso-Pecina, Javier Arellano-Verdejo, Rocio Diego-Celis

Int. Trans. Oper. Res., 2022

2019

Optimal allocation of public parking spots in a smart city: problem characterisation and first algorithms.

Javier Arellano-Verdejo, Federico Alonso-Pecina, Enrique Alba, Adolfo Guzmán-Arenas

J. Exp. Theor. Artif. Intell., 2019

2017

A New Efficient Entropy Population-Merging Parallel Model for Evolutionary Algorithms.

Javier Arellano-Verdejo, Salvador Godoy-Calderón, Federico Alonso-Pecina, Adolfo Guzmán-Arenas, Marco Antonio Cruz-Chavez

Int. J. Comput. Intell. Syst., 2017

2014

The Erdős-Faber-Lovász conjecture is true for n ≤ 12.

David Romero, Federico Alonso-Pecina

Discret. Math. Algorithms Appl., 2014

2012

Ad hoc heuristic for the cover printing problem.

David Romero, Federico Alonso-Pecina

Discret. Optim., 2012

2008

An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling.

Juan Frausto Solís, Federico Alonso-Pecina, Jaime Mora-Vargas

Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008