Salta al contenuto principale
Ricerc@Sapienza
Toggle navigation
Home
Login
Home
Persone
fabio.furini@uniroma1.it
Fabio Furini
Professore Associato
Struttura:
DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-
E-mail:
fabio.furini@uniroma1.it
Pagina istituzionale corsi di laurea
Curriculum Sapienza
Pubblicazioni
Titolo
Pubblicato in
Anno
A note on selective line-graphs and partition colorings
OPERATIONS RESEARCH LETTERS
2019
QPLIB: a library of quadratic programming instances
MATHEMATICAL PROGRAMMING COMPUTATION
2019
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
COMPUTERS & OPERATIONS RESEARCH
2019
Benders decomposition for very large scale partial set covering and maximal covering location problems
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
2019
Exact approaches for the knapsack problem with setups
COMPUTERS & OPERATIONS RESEARCH
2018
On the Product Knapsack Problem
OPTIMIZATION LETTERS
2018
An exact algorithm for the Partition Coloring Problem
COMPUTERS & OPERATIONS RESEARCH
2018
ILP Models and Column Generation for the Minimum Sum Coloring Problem
ELECTRONIC NOTES IN DISCRETE MATHEMATICS
2018
Improving the Approximated Projected Perspective Reformulation by dual information
OPERATIONS RESEARCH LETTERS
2017
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
2017
Solving vertex coloring problems as maximum weight stable set problems
DISCRETE APPLIED MATHEMATICS
2017
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
NETWORKS
2017
The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
2016
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation
INFORMATION PROCESSING LETTERS
2016
Lower Bounding Techniques for DSATUR-based Branch and Bound
ELECTRONIC NOTES IN DISCRETE MATHEMATICS
2016
Approximated perspective relaxations: a project and lift approach
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2016
Approaches to a real-world Train Timetabling Problem in a railway node
OMEGA
2016
Modeling two-dimensional guillotine cutting problems via integer programming
INFORMS JOURNAL ON COMPUTING
2016
Improved rolling horizon approaches to the aircraft sequencing problem
JOURNAL OF SCHEDULING
2015
Heuristic and exact algorithms for the interval min-max regret knapsack problem
INFORMS JOURNAL ON COMPUTING
2015
« prima
< precedente
1
2
3
seguente ›
ultima »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma