PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Grosso, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.

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

Dr. Andrea Thom University of Stuttgart

Andrea Loi University of Stuttgart

Andrea Hein

Dr. -Ing. Andrea Toulouse University of Stuttgart

Andrea Hauff University of Stuttgart

 

Other publications of authors with the same name

An experimental analysis of a population based approach for global optimization., , and . Comp. Opt. and Appl., 38 (3): 351-370 (2007)A heuristic approach for the max-min diversity problem based on max-clique., , and . Computers & OR, 36 (8): 2429-2433 (2009)Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem., , and . CoRR, (2018)Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic., , , , and . GLOBECOM, page 1520-1525. IEEE, (2001)An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem., , and . Oper. Res. Lett., 32 (1): 68-72 (2004)Solving the problem of packing equal and unequal circles in a circular container., , , and . J. Global Optimization, 47 (1): 63-81 (2010)Simple ingredients leading to very efficient heuristics for the maximum clique problem., , and . J. Heuristics, 14 (6): 587-612 (2008)Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem., , and . Computers & OR, 39 (6): 1213-1217 (2012)Design of Logical Topologies in Wavelength-Routed IP Networks., , , , and . Photonic Network Communications, 4 (3-4): 423-442 (2002)Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine., and . Comput. Oper. Res., (2022)