List of works - Fabio Furini

Aircraft Sequencing Problems via a Rolling Horizon Algorithm

article published in 2012

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

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

A fast heuristic approach for train timetabling in a railway node

scholarly article by Fabio Furini & Martin Philip Kidd published June 2013 in Electronic Notes in Discrete Mathematics

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

Lower Bounding Techniques for DSATUR-based Branch and Bound

scholarly article by Fabio Furini et al published June 2016 in Electronic Notes in Discrete Mathematics

Approaches to a real-world Train Timetabling Problem in a railway node

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

article by Fabio Furini et al published 8 November 2016 in Networks

The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace

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

The vertex k-cut problem

scholarly article by Denis Cornaz et al published September 2018 in Discrete Optimization

Exact approaches for the knapsack problem with setups

Exact weighted vertex coloring via branch-and-price

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

scientific article published in June 2019

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming

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

article by Fabio Furini et al published 2014 in Lecture Notes in Computer Science

Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation

scholarly article by Alberto Caprara et al published May 2016 in Information Processing Letters

Mathematical formulations for the Balanced Vertex k-Separator Problem

Approximated perspective relaxations: a project and lift approach

Matheuristics for the Temporal Bin Packing Problem

Automatic Dantzig–Wolfe reformulation of mixed integer programs

Hybrid SDP Bounding Procedure

On the Product Knapsack Problem

Solving vertex coloring problems as maximum weight stable set problems

scholarly article by Denis Cornaz et al published January 2017 in Discrete Applied Mathematics

The maximum clique interdiction problem

scientific article published in February 2019

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

article by Alberto Caprara et al published March 2014 in IEEE Transactions on Signal Processing

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation

Improving the Approximated Projected Perspective Reformulation by dual information

scholarly article by Antonio Frangioni et al published September 2017 in Operations Research Letters

Tighter MIP models for Barge Container Ship Routing

ILP and CP Formulations for the Lazy Bureaucrat Problem

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

Improved rolling horizon approaches to the aircraft sequencing problem

ILP Models and Column Generation for the Minimum Sum Coloring Problem

scholarly article by Fabio Furini et al published February 2018 in Electronic Notes in Discrete Mathematics

List of works by Fabio Furini