Fabio Furini

发表

Approaches to a real-world train timetabling problem in a railway node

Valentina Cacchiani, Fabio Furini, Martin Philip Kidd, 2016 .

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

Pablo San Segundo, Stefano Coniglio, Fabio Furini, 2021, Eur. J. Oper. Res..

Theoretical and computational study of several linearisation techniques for binary quadratic problems

Fabio Furini, Emiliano Traversi, 2019, Ann. Oper. Res..

Matheuristics for the Temporal Bin Packing Problem

Fabio Furini, Xueying Shen, Fabio Furini, 2018 .

Improved rolling horizon approaches to the aircraft sequencing problem

Paolo Toth, Fabio Furini, Martin Philip Kidd, 2015, J. Sched..

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem

Manuel Iori, Mutsunori Yagiura, Silvano Martello, 2015, INFORMS J. Comput..

Models for the two-dimensional two-stage cutting stock problem with multiple stock size

Fabio Furini, Enrico Malaguti, Fabio Furini, 2013, Comput. Oper. Res..

Decomposition and reformulation of integer linear programming problems

Fabio Furini, Fabio Furini, 2012, 4OR.

A branch-and-price algorithm for the temporal bin packing problem

Mauro Dell'Amico, Manuel Iori, Fabio Furini, 2019, Comput. Oper. Res..

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Pablo San Segundo, Stefano Coniglio, Ivana Ljubic, 2019, Eur. J. Oper. Res..

Exact weighted vertex coloring via branch-and-price

Fabio Furini, Enrico Malaguti, E. Malaguti, 2012, Discret. Optim..

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting

Paolo Toth, Fabio Furini, Martin Philip Kidd, 2014, ISCO.

Aircraft Sequencing Problems via a Rolling Horizon Algorithm

Paolo Toth, Fabio Furini, Alfredo Persiani, 2012, ISCO.

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

Pablo San Segundo, Jorge Artieda, Fabio Furini, 2019, Comput. Oper. Res..

16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization CNAM, Paris, France, June 18-20, 2018 : Proceedings of the Workshop

Fabio Furini, Leo Liberti, Emiliano Traversi, 2018 .

ILP Models and Column Generation for the Minimum Sum Coloring Problem

Fabio Furini, Enrico Malaguti, Sébastien Martin, 2018, Electron. Notes Discret. Math..

On integer and bilevel formulations for the k-vertex cut problem

Fabio Furini, Enrico Malaguti, Ivana Ljubić, 2019, Mathematical Programming Computation.

Improving the Approximated Projected Perspective Reformulation by dual information

Claudio Gentile, Fabio Furini, Antonio Frangioni, 2017, Oper. Res. Lett..

The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace

Paolo Toth, Fabio Furini, Carlo Alfredo Persiani, 2016 .

An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem

Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier, 2017, Networks.

Lower Bounding Techniques for DSATUR-based Branch and Bound

Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier, 2016, Electron. Notes Discret. Math..

Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics

Alberto Caprara, Andrea Lodi, Riccardo Rovatti, 2014, IEEE Transactions on Signal Processing.

QPLIB: a library of quadratic programming instances

Andrea Lodi, Nikolaos V. Sahinidis, Leo Liberti, 2018, Mathematical Programming Computation.

A fast heuristic approach for train timetabling in a railway node

Fabio Furini, Martin Philip Kidd, 2013, Electron. Notes Discret. Math..

Hybrid SDP Bounding Procedure

Fabio Furini, Emiliano Traversi, 2013, SEA.

A note on selective line-graphs and partition colorings

Fabio Furini, Enrico Malaguti, Denis Cornaz, 2019, Oper. Res. Lett..

MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover

Fabio Furini, Virginie Gabrel, Xueying Shen, 2016, ISCO.

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation

Alberto Caprara, Fabio Furini, Enrico Malaguti, 2011, IPCO.

Exact approaches for the knapsack problem with setups

Michele Monaci, Fabio Furini, Emiliano Traversi, 2018, Comput. Oper. Res..

The vertex k-cut problem

Ali Ridha Mahjoub, Fabio Furini, Mathieu Lacroix, 2019, Discret. Optim..

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming

Fabio Furini, Enrico Malaguti, Dimitri Thomopulos, 2016, INFORMS J. Comput..

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Ivana Ljubic, Markus Sinnl, Fabio Furini, 2017, Eur. J. Oper. Res..

Automatic Dantzig–Wolfe reformulation of mixed integer programs

Alberto Ceselli, Alberto Caprara, Fabio Furini, 2014, Mathematical Programming.

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems

Fabio Furini, Enrico Malaguti, Denis Cornaz, 2017, CTW.

A lexicographic pricer for the fractional bin packing problem

Stefano Coniglio, Fabio D'Andreagiovanni, Fabio Furini, 2019, Oper. Res. Lett..

A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size

Paolo Toth, Fabio Furini, Enrico Malaguti, 2012, Eur. J. Oper. Res..

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation

Alberto Caprara, Fabio Furini, Enrico Malaguti, 2016, Inf. Process. Lett..

Benders decomposition for very large scale partial set covering and maximal covering location problems

Jean-François Cordeau, Ivana Ljubic, Fabio Furini, 2019, Eur. J. Oper. Res..

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

Alberto Caprara, Fabio Furini, Enrico Malaguti, 2013, INFORMS J. Comput..

Mathematical formulations for the Balanced Vertex k-Separator Problem

Ali Ridha Mahjoub, Fabio Furini, Mathieu Lacroix, 2014, 2014 International Conference on Control, Decision and Information Technologies (CoDIT).

Preface: decomposition methods for hard optimization problems

Fabio Furini, Emiliano Traversi, Ivana Ljubić, 2020, Ann. Oper. Res..

The maximum clique interdiction problem

Pablo San Segundo, Ivana Ljubic, Fabio Furini, 2019, Eur. J. Oper. Res..

On the Product Knapsack Problem

Michele Monaci, Fabio Furini, Claudia D'Ambrosio, 2018, Optim. Lett..

Tighter MIP models for Barge Container Ship Routing

Tatjana Davidović, Fabio Furini, Ivana Ljubić, 2017, Omega.

ILP and CP Formulations for the Lazy Bureaucrat Problem

Ivana Ljubic, Markus Sinnl, Fabio Furini, 2015, CPAIOR.

An exact algorithm for the Partition Coloring Problem

Fabio Furini, Enrico Malaguti, Alberto Santini, 2018, Comput. Oper. Res..

Approximated perspective relaxations: a project and lift approach

Claudio Gentile, Fabio Furini, Antonio Frangioni, 2016, Comput. Optim. Appl..

A branch-and-cut algorithm for the Edge Interdiction Clique Problem

Pablo San Segundo, Ivana Ljubic, Fabio Furini, 2021, Eur. J. Oper. Res..

Preface: CTW 2018

Leo Liberti, Fabio Furini, Emiliano Traversi, 2021, Discret. Appl. Math..

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques

Stefan Irnich, Fabio Furini, Timo Gschwind, 2020, INFORMS J. Comput..

A branch-and-price algorithm for the Minimum Sum Coloring Problem

Fabio Furini, Diego Delle Donne, Enrico Malaguti, 2020, Discret. Appl. Math..

On the exact separation of cover inequalities of maximum-depth

Stefano Coniglio, Fabio Furini, Daniele Catanzaro, 2021 .

Minimax Robust Unit Commitment Problem with Demand and Market Price uncertainty

Fabio Furini, Manuel Laguna, Michele Samorani, 2012 .

Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems

Jean-François Cordeau, Fabio Furini, Ivana Ljubić, 2018 .