A polynomial algorithm for the p-centdian problem on a tree. - Arie Tamir; Dionisio Pérez-Brito; José A. Moreno-Pérez (Networks, 1998)

Variable Neighborhood Decomposition Search. - Pierre Hansen; Nenad Mladenovic; Dionisio Pérez-Brito (J. Heuristics, 2001)

The centdian subtree on tree networks. - Arie Tamir; Justo Puerto; Dionisio Pérez-Brito (Discret. Appl. Math., 2002)

Variable neighborhood search for the linear ordering problem. - Carlos G. García-González; Dionisio Pérez-Brito; Vicente Campos; Rafael Martí (Comput. Oper. Res., 2006)

The bi-criteria doubly weighted center-median path problem on a tree. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir; Dionisio Pérez-Brito (Networks, 2006)

Center location problems on tree graphs with subtree-shaped customers. - Justo Puerto; Arie Tamir; Juan A. Mesa; Dionisio Pérez-Brito (Discret. Appl. Math., 2008)

Variable neighbourhood search for bandwidth reduction. - Nenad Mladenovic; Dragan Urosevic; Dionisio Pérez-Brito; Carlos G. García-González (Eur. J. Oper. Res., 2010)

A modified variable neighborhood search for the discrete ordered median problem. - Justo Puerto; Dionisio Pérez-Brito; Carlos G. García-González (Eur. J. Oper. Res., 2014)