( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Getting the Best Results in Controlled Rounding with the Least Effort.

, , , , , и . Privacy in Statistical Databases, том 3050 из Lecture Notes in Computer Science, стр. 58-72. Springer, (2004)

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.

Marcelo José González Salazar

José González

José González

José González Valle

José González Salinas

 

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

A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods.. Operations Research, 53 (5): 819-829 (2005)Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression.. Privacy in Statistical Databases, том 6344 из Lecture Notes in Computer Science, стр. 29-40. Springer, (2010)International Network Optimization Conference, Tenerife 2013., , , и . Electron. Notes Discret. Math., (2013)A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem., , и . Comput. Oper. Res., 36 (5): 1639-1645 (2009)A local branching heuristic for the capacitated fixed-charge network design problem., и . Comput. Oper. Res., 37 (3): 575-581 (2010)Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm., , , и . Eur. J. Oper. Res., 273 (2): 452-463 (2019)The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic., и . INOC, том 6701 из Lecture Notes in Computer Science, стр. 401-405. Springer, (2011)Further Developments with Perturbation Techniques to Protect Tabular Data., и . Privacy in Statistical Databases, том 8744 из Lecture Notes in Computer Science, стр. 24-35. Springer, (2014)Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route., , и . Networks, 61 (4): 309-321 (2013)Optimal Solutions for the Vehicle Routing Problem with Split Demands., и . ICCL, том 11756 из Lecture Notes in Computer Science, стр. 189-203. Springer, (2019)