Fabio Furini
Citat de
Citat de
Benders decomposition for very large scale partial set covering and maximal covering location problems
JF Cordeau, F Furini, I Ljubić
European Journal of Operational Research 275 (3), 882-896, 2019
Approaches to a real-world train timetabling problem in a railway node
V Cacchiani, F Furini, MP Kidd
Omega 58, 97-110, 2016
Improved rolling horizon approaches to the aircraft sequencing problem
F Furini, MP Kidd, CA Persiani, P Toth
Journal of Scheduling 18, 435-447, 2015
QPLIB: a library of quadratic programming instances
F Furini, E Traversi, P Belotti, A Frangioni, A Gleixner, N Gould, L Liberti, ...
Mathematical Programming Computation 11, 237-265, 2019
Automatic Dantzig–Wolfe reformulation of mixed integer programs
M Bergner, A Caprara, A Ceselli, F Furini, ME Lübbecke, E Malaguti, ...
Mathematical Programming 149 (1), 391-424, 2015
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
F Furini, E Malaguti, RM Durán, A Persiani, P Toth
European Journal of Operational Research 218 (1), 251-260, 2012
Modeling two-dimensional guillotine cutting problems via integer programming
F Furini, E Malaguti, D Thomopulos
INFORMS Journal on Computing 28 (4), 736-751, 2016
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
F Furini, E Malaguti
Computers & Operations Research 40 (8), 1953-1962, 2013
A branch-and-price algorithm for the temporal bin packing problem
M Dell’Amico, F Furini, M Iori
Computers & operations research 114, 104825, 2020
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
S Coniglio, F Furini, P San Segundo
European Journal of Operational Research 289 (2), 435-455, 2021
Heuristic and exact algorithms for the interval min–max regret knapsack problem
F Furini, M Iori, S Martello, M Yagiura
INFORMS Journal on Computing 27 (2), 392-405, 2015
The maximum clique interdiction problem
F Furini, I Ljubić, S Martin, P San Segundo
European Journal of Operational Research 277 (1), 112-127, 2019
Exact approaches for the knapsack problem with setups
F Furini, M Monaci, E Traversi
Computers & Operations Research 90, 208-220, 2018
The time dependent traveling salesman planning problem in controlled airspace
F Furini, CA Persiani, P Toth
Transportation Research Part B: Methodological 90, 38-55, 2016
Approximated perspective relaxations: a project and lift approach
A Frangioni, F Furini, C Gentile
Computational Optimization and Applications 63, 705-735, 2016
Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem
A Caprara, F Furini, E Malaguti
INFORMS Journal on Computing 25 (3), 560-571, 2013
Tighter MIP models for barge container ship routing
L Alfandari, T Davidović, F Furini, I Ljubić, V Maraą, S Martin
Omega 82, 38-54, 2019
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
F Furini, I Ljubić, M Sinnl
European journal of operational research 262 (2), 438-448, 2017
Aircraft sequencing problems via a rolling horizon algorithm
F Furini, CA Persiani, P Toth
Combinatorial Optimization: Second International Symposium, ISCO 2012 …, 2012
Solving vertex coloring problems as maximum weight stable set problems
D Cornaz, F Furini, E Malaguti
Discrete Applied Mathematics 217, 151-162, 2017
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20