( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding Robust Solutions to Stable Marriage.

, , , и . IJCAI, стр. 631-637. ijcai.org, (2017)

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.

Jérôme Simonin

Wolfgang Gilles

Josef Gilles

Susanne Gilles

Alfons Gilles

 

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

Impact de la contrainte d'incompatibilité sur la complexité et l'approximation des problèmes d'ordonnancement en présence de tâches-couplées. (Impact of the compatibility constraint on the complexity and approximation of the scheduling problems according to coupled-tasks).. Montpellier 2 University, France, (2009)Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks., , и . Electron. Notes Discret. Math., (2010)Complexity Study for the Robust Stable Marriage Problem., , , и . Theor. Comput. Sci., (2019)Complexity and approximation for scheduling problem for a torpedo., , и . Comput. Ind. Eng., 61 (2): 352-356 (2011)Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources., , , и . AAAI, стр. 1512-1519. AAAI Press, (2020)Optimisation for the Ride-Sharing Problem: a Complexity-based Approach., и . ECAI, том 263 из Frontiers in Artificial Intelligence and Applications, стр. 831-836. IOS Press, (2014)Requests Management for Smartphone-Based Matching Applications Using a Multi-agent Approach., и . LION, том 10079 из Lecture Notes in Computer Science, стр. 173-186. Springer, (2016)An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem., , , и . CPAIOR, том 11494 из Lecture Notes in Computer Science, стр. 320-336. Springer, (2019)