( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A new formulation for the Safe Set problem on graphs.

, , , , и . Comput. Oper. Res., (2019)

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.

Theo Simonetti

 

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

A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow., , , , и . CoRR, (2015)Formulating and Solving the Minimum Dominating Cycle Problem., , и . Electron. Notes Discret. Math., (2013)A new formulation for the Safe Set problem on graphs., , , , и . Comput. Oper. Res., (2019)Logistics SLA optimization service for transportation in smart cities., , , , , и . IJCNN, стр. 1-8. IEEE, (2018)An Exact Method for the Minimum Caterpillar Spanning Problem., , и . CTW, стр. 48-51. (2009)A Biased Random-Key Genetic Algorithm for the Traffic Counting Location Problem., , , , и . BRACIS, стр. 275-280. IEEE, (2019)Distance Transformation for Network Design Problems., , , и . SIAM J. Optim., 29 (2): 1687-1713 (2019)Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem., , и . INOC, том 6701 из Lecture Notes in Computer Science, стр. 176-181. Springer, (2011)New proposals for modelling and solving the problem of covering solids using spheres of different radii., , , , , и . RAIRO Oper. Res., 54 (3): 873-882 (2020)Reformulations and solution algorithms for the maximum leaf spanning tree problem., , и . Comput. Manag. Science, 7 (3): 289-311 (2010)