Pubblicazioni di Furini Fabio
2023
Martinovic J., Strasdat N., Valerio de Carvalho J., Furini F.
A combinatorial flow-based formulation for temporal bin packing problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023: 554-574
San Segundo P., Furini F., Alvarez D., Pardalos P. M.
CliSAT: A new exact algorithm for hard maximum clique problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023: 1008-1025
2022
San Segundo P., Furini F., Leon R.
A new branch-and-filter exact algorithm for binary constraint satisfaction problems. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022: 448-467
Furini F., Ljubic I., Malaguti E., Paronuzzi P.
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. OPERATIONS RESEARCH 2022: 2399-2420
Catanzaro D., Coniglio S., Furini F.
On the exact separation of cover inequalities of maximum-depth. OPTIMIZATION LETTERS 2022: 449-469
Coniglio S., Furini F., Ljubic I.
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. MATHEMATICAL PROGRAMMING 2022: 9-56
Martinovic J., Strasdat N., Valerio de Carvalho J., Furini F.
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. OPTIMIZATION LETTERS 2022: 2333-2358
2021
Furini F., Ljubic I., San Segundo P., Zhao Y.
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021: 54-69
Delle Donne D., Furini F., Malaguti E., Wolfler Calvo R.
A branch-and-price algorithm for the Minimum Sum Coloring Problem. DISCRETE APPLIED MATHEMATICS 2021: 39-56
Gschwind T., Irnich S., Furini F., Calvo R. W.
A branch-and-price framework for decomposing graphs into relaxed cliques. INFORMS JOURNAL ON COMPUTING 2021: 1070-1090
Coniglio S., Furini F., San Segundo P.
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021: 435-455
2020
Dell'Amico M., Furini F., Iori M.
A branch-and-price algorithm for the temporal bin packing problem. COMPUTERS & OPERATIONS RESEARCH 2020: -
Furini F., Ljubic I., Malaguti E., Paronuzzi P.
On integer and bilevel formulations for the k-vertex cut problem. MATHEMATICAL PROGRAMMING COMPUTATION 2020: 133-164
2019
Coniglio S., D'Andreagiovanni F., Furini F.
A lexicographic pricer for the fractional bin packing problem. OPERATIONS RESEARCH LETTERS 2019: 622-628
San Segundo P., Coniglio S., Furini F., Ljubic I.
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019: 76-90
Cornaz D., Furini F., Malaguti E., Santini A.
A note on selective line-graphs and partition colorings. OPERATIONS RESEARCH LETTERS 2019: 565-568
Furini F., Ljubic I., Martin S., San Segundo P.
The maximum clique interdiction problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019: 112-127
Cornaz D., Furini F., Lacroix M., Malaguti E., Mahjoub A. R., Martin S.
The vertex k-cut problem. DISCRETE OPTIMIZATION 2019: 8-28
Furini F., Traversi E.
Theoretical and computational study of several linearisation techniques for binary quadratic problems. ANNALS OF OPERATIONS RESEARCH 2019: 387-411
Alfandari L., Davidovic T., Furini F., Ljubic I., Maras V., Martin S.
Tighter MIP models for Barge Container Ship Routing. OMEGA 2019: 38-54