( en | de | ru )

 

Disambiguation of "Croce, Federico Della"

Author of the publication

copydeleteadd this publication to your clipboard
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.

, , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 186-197. Springer, (2014)

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.

Karl Croce

Franz Croce

Sergio Dellavalle

Roberto Croce

Geerd Dellas

 

Other publications of authors with the same name

Approximating the Incremental Knapsack Problem., , and . CoRR, (2018)Exact Algorithms for Dominating Clique Problems., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 4-13. Springer, (2009)A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem., , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 186-197. Springer, (2014)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)An exact approach for the 0-1 knapsack problem with setups., , and . Comput. Oper. Res., (2017)A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment., and . Comput. Oper. Res., 39 (12): 3244-3246 (2012)Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem., and . Oper. Res. Lett., 31 (2): 142-148 (2003)Heuristic approaches for a domestic energy management system., , , , , and . Comput. Ind. Eng., (2017)New exact approaches and approximation results for the Penalized Knapsack Problem., , and . Discret. Appl. Math., (2019)On approximating the Incremental Knapsack Problem., , and . Discret. Appl. Math., (2019)