( en | de | ru )

 

Disambiguation of "Méndez-Díaz, Isabel"

Author of the publication

copydeleteadd this publication to your clipboard
Composite Retrieval of Diverse and Complementary Bundles.

, , , , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

José Armando Díaz Méndez

Isabel Rica Mendez

Sofia Méndez

Leonardo Díaz

Juan Díaz Ochoa

 

Other publications of authors with the same name

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