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

Navegar

Colección

Datos Estadísticas

Lista de

Branch and cut
6
"An integer programming approach to b-coloring" (2018) Koch, I.; Marenco, J. Discrete Optimization
"An integer programming approach for the time-dependent traveling salesman problem with time windows" (2017) Montero, A.; Méndez-Díaz, I.; Miranda-Bront, J.J. Computers and Operations Research. 88:280-289
"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
"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
"Facets and valid inequalities for the time-dependent travelling salesman problem" (2013) Miranda-Bront, J.J.; Méndez-Díaz, I.; Zabala, P. European Journal of Operational Research
"Infeasible path formulations for the time-dependent TSP with time windows" (2011) Méndez-Díaz, I.; Miranda-Bront, J.J.; Toth, P.; Zabala, P. 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011:198-202