( en | de | ru )

 

Disambiguation of "Furini, Fabio"

Author of the publication

copydeleteadd this publication to your clipboard
On the exact separation of cover inequalities of maximum-depth.

, , and . Optim. Lett., 16 (2): 449-469 (2022)

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.

Fabio Furini

Antonella Furini

Fabio Galbusera

Fabio Farinon

Fabio Giovannini

 

Other publications of authors with the same name

A branch-and-price algorithm for the Minimum Sum Coloring Problem., , , and . Discret. Appl. Math., (2021)Preface: CTW 2018., , , , and . Discret. Appl. Math., (2021)A branch-and-cut algorithm for the Edge Interdiction Clique Problem., , , and . Eur. J. Oper. Res., 294 (1): 54-69 (2021)Theoretical and computational study of several linearisation techniques for binary quadratic problems., and . Ann. Oper. Res., 279 (1-2): 387-411 (2019)On integer and bilevel formulations for the k-vertex cut problem., , , and . Math. Program. Comput., 12 (2): 133-164 (2020)CliSAT: A new exact algorithm for hard maximum clique problems., , , and . Eur. J. Oper. Res., 307 (3): 1008-1025 (June 2023)A new branch-and-bound algorithm for the maximum edge-weighted clique problem., , , and . Eur. J. Oper. Res., 278 (1): 76-90 (2019)Models for the two-dimensional two-stage cutting stock problem with multiple stock size., and . Comput. Oper. Res., 40 (8): 1953-1962 (2013)Preface: decomposition methods for hard optimization problems., , and . Ann. Oper. Res., 284 (2): 483-485 (2020)A branch-and-price algorithm for the temporal bin packing problem., , and . Comput. Oper. Res., (2020)