( en | de | ru )

 

Disambiguation of "Díaz, Juan A."

Author of the publication

copydeleteadd this publication to your clipboard
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment.

, , and . INFORMS J. Comput., 23 (1): 41-55 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Juan Díaz Ochoa

Juan Díaz-Santanilla

Juan Manuel Díaz Yarto

Juan Lorenzo Díaz-Naveas

Juan Clemente Díaz Gonzáles

 

Other publications of authors with the same name

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment., , and . INFORMS J. Comput., 23 (1): 41-55 (2011)A dual bounding scheme for a territory design problem., , and . Comput. Oper. Res., (2014)Primal and dual bounds for the vertex p-median problem with balance constraints., and . Ann. Oper. Res., 258 (2): 613-638 (2017)Lagrangean duals and exact solution to the capacitated p-center problem., , and . Eur. J. Oper. Res., 201 (1): 71-81 (2010)A hybrid algorithm for the manufacturing cell formation problem., , and . J. Heuristics, 19 (1): 77-96 (2013)A compact model and tight bounds for a combined location-routing problem., , and . Comput. Oper. Res., (2005)Math-Heuristic for a Territory Design Problem., , and . ICCL, volume 11756 of Lecture Notes in Computer Science, page 67-82. Springer, (2019)Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem., , , and . Comput. Oper. Res., (January 2024)GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence., and . J. Oper. Res. Soc., 69 (9): 1493-1511 (2018)A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem., and . J. Oper. Res. Soc., 53 (7): 728-740 (2002)