logo biblio digital exactas
logo twitter logo instagram logo whatsapp logo mail

Navegar

Colección

Datos Estadísticas

Lista de

Branch-and-cut algorithms
8
"Facets and valid inequalities for the time-dependent travelling salesman problem" (2014) Miranda-Bront, J.J.; Méndez-Díaz, I.; Zabala, P. European Journal of Operational Research. 236(3):891-902
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem" (2011) Delle Donne, D.; Marenco, J. Discrete Optimization. 8(4):540-554
"Solving a multicoloring problem with overlaps using integer programming" (2010) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 158(4):349-354
"A new formulation for the Traveling Deliveryman Problem" (2008) Méndez-Díaz, I.; Zabala, P.; Lucena, A. Discrete Applied Mathematics. 156(17):3223-3237
"A new formulation for the Traveling Deliveryman Problem" (2008) Méndez-Díaz, I.; Zabala, P.; Lucena, A. Discrete Applied Mathematics. 156(17):3223-3237
"A Branch-and-Cut algorithm for graph coloring" (2006) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 154(5 SPEC ISS):826-847
"A Branch-and-Cut algorithm for graph coloring" (2006) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 154(5 SPEC ISS):826-847