P. Copado-Mendez

A branch-and-price-and-cut method for train unit scheduling with complex minimum turnround time requirements

R. S. Kwan, R. Kwan, Zhiyuan Lin, 2018 .

Size Limited Iterative Method : A Hybridized Heuristic for Train Unit Scheduling Optimization

Zhiyuan, R. Kwan, Lin, 2018 .

Enhancing the ϵ-constraint method through the use of objective reduction and random sequences: Application to environmental problems

Gonzalo Guillén-Gosálbez, Laureano Jiménez, Pedro J. Copado-Méndez, 2016, Comput. Chem. Eng..

Agile Computational Intelligence for Supporting Hospital Logistics During the COVID-19 Crisis

A. Juan, Miguel Saiz, R. D. Tordecilla, 2021, Computational Management.

Maximizing customers' lifetime value using limited marketing resources

Anita Goyal, A. Juan, Javier Panadero, 2021, Marketing Intelligence & Planning.

A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery

Angel A. Juan, Javier Panadero, Pedro J. Copado-Méndez, 2020, Algorithms.

Large neighbourhood search applied to the efficient solution of spatially explicit strategic supply chain management problems

Gonzalo Guillén-Gosálbez, Christian Blum, Laureano Jiménez, 2013, Comput. Chem. Eng..

Application of Large Neighborhood Search to Strategic Supply Chain Management in the Chemical Industry

Christian Blum, Laureano Jiménez, Pedro J. Copado-Méndez, 2013, Hybrid Metaheuristics.