( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Composite Retrieval of Diverse and Complementary Bundles.

, , , , , и . IEEE Trans. Knowl. Data Eng., 26 (11): 2662-2675 (2014)

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.

José Armando Díaz Méndez

Isabel Rica Mendez

Sofia Méndez

Leonardo Díaz

Juan Díaz Ochoa

 

Другие публикации лиц с тем же именем

A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem., , , и . Electron. Notes Discret. Math., (2010)A DSATUR-based algorithm for the Equitable Coloring Problem., , и . Comput. Oper. Res., (2015)An integer programming approach for the time-dependent traveling salesman problem with time windows., , и . Comput. Oper. Res., (2017)The Pickup and Delivery Problem with Incompatibility Constraints., , и . CTW, стр. 150-153. (2011)Infeasible path formulations for the time-dependent TSP with time windows., , , и . CTW, стр. 198-202. (2011)A Tabu Search Heuristic for the Equitable Coloring Problem., , и . ISCO, том 8596 из Lecture Notes in Computer Science, стр. 347-358. Springer, (2014)A cutting plane algorithm for graph coloring., и . Discret. Appl. Math., 156 (2): 159-179 (2008)A Branch-and-Cut algorithm for graph coloring., и . Discret. Appl. Math., 154 (5): 826-847 (2006)Complexity and algorithms for composite retrieval., , , , , и . WWW (Companion Volume), стр. 79-80. International World Wide Web Conferences Steering Committee / ACM, (2013)An exact DSatur-based algorithm for the Equitable Coloring Problem., , и . Electron. Notes Discret. Math., (2013)