PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Croce, Federico Della"

Author of the publication

copydeleteadd this publication to your clipboard
An exact algorithm for MAX-CUT in sparse graphs.

, , and . Oper. Res. Lett., 35 (3): 403-408 (2007)

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.

Federico Pinchetti University of Stuttgart

 

Other publications of authors with the same name

The Red-Blue transportation problem., , , and . European Journal of Operational Research, 237 (3): 814-823 (2014)A single machine scheduling problem with two-dimensional vector packing constraints., , and . European Journal of Operational Research, 243 (1): 75-81 (2015)A variable neighborhood search based matheuristic for nurse rostering problems., and . Annals OR, 218 (1): 185-199 (2014)A matheuristic approach for the two-machine total completion time flow shop problem., , and . Annals OR, 213 (1): 67-78 (2014)Complexity of single machine scheduling problems under scenario-based uncertainty., and . Oper. Res. Lett., 36 (3): 338-342 (2008)An exact algorithm for MAX-CUT in sparse graphs., , and . Oper. Res. Lett., 35 (3): 403-408 (2007)Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem., and . Oper. Res. Lett., 31 (2): 142-148 (2003)A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment., and . Computers & OR, 39 (12): 3244-3246 (2012)Exact Algorithms for Dominating Clique Problems., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 4-13. Springer, (2009)A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem., , and . EvoCOP, volume 6622 of Lecture Notes in Computer Science, page 38-47. Springer, (2011)