Lista de

NP-hard
6
"Computing the P 3 -hull number of a graph, a polyhedral approach" (2019) Blaum, M.; Marenco, J. Discrete Applied Mathematics. 255:155-166
"On star and biclique edge-colorings" (2017) Dantas, S.;Groshaus, M.;Guedes, A. (...)Sasaki, D. International Transactions in Operational Research. 24(1-2):339-346
"On star and biclique edge-colorings" (2017) Dantas, S.;Groshaus, M.;Guedes, A. (...)Sasaki, D. International Transactions in Operational Research. 24(1-2):339-346
"Approximation algorithms for clique transversals on some graph classes" (2015) Lin, M.C.; Vasiliev, S. Information Processing Letters. 115(9):667-670
"Approximation algorithms for clique transversals on some graph classes" (2015) Lin, M.C.; Vasiliev, S. Information Processing Letters. 115(9):667-670
"A column generation algorithm for choice-based network revenue management" (2009) Bront, J.J.M.; Méndez-Díaz, I.; Vulcano, G. Operations Research. 57(3):769-784