( en | de | ru )

 

Disambiguation of "Rossi, Fabrizio"

Author of the publication

copydeleteadd this publication to your clipboard
Constraint Orbital Branching.

, , , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 225-239. Springer, (2008)

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.

Fabrizio Catanese

Fabrizio Gabbiani

Fabrizio Gabrielli

Fabrizio Lindner

Fabrizio Arosio

 

Other publications of authors with the same name

Seismic source parameters from InSAR data trough neural networks trough reads through., , , and . IGARSS, page 2981-2984. IEEE, (2004)Constraint Orbital Branching., , , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 225-239. Springer, (2008)A Manifesto for Applied Data Science - Reasoning from a Business Perspective., , , , , , , , , and 4 other author(s). itaDATA, volume 3340 of CEUR Workshop Proceedings, page 123-131. CEUR-WS.org, (2022)Leveraging Web Analytics for Automatically Generating Mobile Navigation Models., , and . IEEE MS, page 103-110. IEEE Computer Society, (2016)Strengthening Chvátal-Gomory Cuts for the Stable Set Problem., , , and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 201-212. Springer, (2016)From monolithic to microservice architecture: an automated approach based on graph clustering and combinatorial optimization., , , , and . ICSA, page 47-57. IEEE, (2023)A New Approach to the Stable Set Problem Based on Ellipsoids., , , and . IPCO, volume 6655 of Lecture Notes in Computer Science, page 223-234. Springer, (2011)An implicit enumeration scheme for the batch selection problem., , and . Networks, 44 (2): 151-159 (2004)Robust Shift Scheduling in Call Centers., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 336-346. Springer, (2014)LP-based dual bounds for the maximum quasi-clique problem., , and . Discret. Appl. Math., (2021)