Остановите войну!
for scientists:
default search action
Fabio Furini
Person information
- affiliation: Sapienza University of Rome, Italy
- affiliation (former): Université Paris Dauphine, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j46]John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
A combinatorial flow-based formulation for temporal bin packing problems. Eur. J. Oper. Res. 307(2): 554-574 (2023) - [j45]Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos:
CliSAT: A new exact algorithm for hard maximum clique problems. Eur. J. Oper. Res. 307(3): 1008-1025 (2023) - [c8]Isma Bentoumi, Fabio Furini, Ali Ridha Mahjoub, Sébastien Martin:
A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CoDIT 2023: 674-677 - 2022
- [j44]Pablo San Segundo, Fabio Furini, Rafael León:
A new branch-and-filter exact algorithm for binary constraint satisfaction problems. Eur. J. Oper. Res. 299(2): 448-467 (2022) - [j43]Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi:
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Oper. Res. 70(4): 2399-2420 (2022) - [j42]Stefano Coniglio, Fabio Furini, Ivana Ljubic:
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196(1): 9-56 (2022) - [j41]Daniele Catanzaro, Stefano Coniglio, Fabio Furini:
On the exact separation of cover inequalities of maximum-depth. Optim. Lett. 16(2): 449-469 (2022) - [j40]John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. 16(8): 2333-2358 (2022) - 2021
- [j39]Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi:
Preface: CTW 2018. Discret. Appl. Math. 296: 1 (2021) - [j38]Diego Delle Donne, Fabio Furini, Enrico Malaguti, Roberto Wolfler Calvo:
A branch-and-price algorithm for the Minimum Sum Coloring Problem. Discret. Appl. Math. 303: 39-56 (2021) - [j37]Stefano Coniglio, Fabio Furini, Pablo San Segundo:
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. Eur. J. Oper. Res. 289(2): 435-455 (2021) - [j36]Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao:
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. Eur. J. Oper. Res. 294(1): 54-69 (2021) - [j35]Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo:
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33(3): 1070-1090 (2021) - 2020
- [j34]Fabio Furini, Ivana Ljubic, Emiliano Traversi:
Preface: decomposition methods for hard optimization problems. Ann. Oper. Res. 284(2): 483-485 (2020) - [j33]Mauro Dell'Amico, Fabio Furini, Manuel Iori:
A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114 (2020) - [j32]Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi:
On integer and bilevel formulations for the k-vertex cut problem. Math. Program. Comput. 12(2): 133-164 (2020)
2010 – 2019
- 2019
- [j31]Fabio Furini, Emiliano Traversi:
Theoretical and computational study of several linearisation techniques for binary quadratic problems. Ann. Oper. Res. 279(1-2): 387-411 (2019) - [j30]Pablo San Segundo, Fabio Furini, Jorge Artieda:
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Comput. Oper. Res. 110: 18-33 (2019) - [j29]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j28]Jean-François Cordeau, Fabio Furini, Ivana Ljubic:
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3): 882-896 (2019) - [j27]Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo:
The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1): 112-127 (2019) - [j26]Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic:
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1): 76-90 (2019) - [j25]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [j24]Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini:
A note on selective line-graphs and partition colorings. Oper. Res. Lett. 47(6): 565-568 (2019) - [j23]Stefano Coniglio, Fabio D'Andreagiovanni, Fabio Furini:
A lexicographic pricer for the fractional bin packing problem. Oper. Res. Lett. 47(6): 622-628 (2019) - 2018
- [j22]Fabio Furini, Michele Monaci, Emiliano Traversi:
Exact approaches for the knapsack problem with setups. Comput. Oper. Res. 90: 208-220 (2018) - [j21]Fabio Furini, Enrico Malaguti, Alberto Santini:
An exact algorithm for the Partition Coloring Problem. Comput. Oper. Res. 92: 170-181 (2018) - [j20]Fabio Furini, Enrico Malaguti, Sébastien Martin, Ian-Christopher Ternier:
ILP Models and Column Generation for the Minimum Sum Coloring Problem. Electron. Notes Discret. Math. 64: 215-224 (2018) - [j19]Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi:
On the Product Knapsack Problem. Optim. Lett. 12(4): 691-712 (2018) - 2017
- [j18]Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving vertex coloring problems as maximum weight stable set problems. Discret. Appl. Math. 217: 151-162 (2017) - [j17]Fabio Furini, Ivana Ljubic, Markus Sinnl:
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262(2): 438-448 (2017) - [j16]Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier:
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. Networks 69(1): 124-141 (2017) - [j15]Antonio Frangioni, Fabio Furini, Claudio Gentile:
Improving the Approximated Projected Perspective Reformulation by dual information. Oper. Res. Lett. 45(5): 519-524 (2017) - 2016
- [j14]Antonio Frangioni, Fabio Furini, Claudio Gentile:
Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63(3): 705-735 (2016) - [j13]Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier:
Lower Bounding Techniques for DSATUR-based Branch and Bound. Electron. Notes Discret. Math. 52: 149-156 (2016) - [j12]Fabio Furini, Enrico Malaguti, Dimitri Thomopulos:
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. INFORMS J. Comput. 28(4): 736-751 (2016) - [j11]Alberto Caprara, Fabio Furini, Enrico Malaguti, Emiliano Traversi:
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116(5): 379-386 (2016) - [c7]Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen:
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. ISCO 2016: 123-134 - 2015
- [j10]Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. INFORMS J. Comput. 27(2): 392-405 (2015) - [j9]Martin Bergner, Alberto Caprara, Alberto Ceselli, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - [j8]Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
Improved rolling horizon approaches to the aircraft sequencing problem. J. Sched. 18(5): 435-447 (2015) - [c6]Fabio Furini, Ivana Ljubic, Markus Sinnl:
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR 2015: 255-270 - [i1]Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW 2015: 36-39 - 2014
- [j7]Alberto Caprara, Fabio Furini, Andrea Lodi, Mauro Mangia, Riccardo Rovatti, Gianluca Setti:
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. IEEE Trans. Signal Process. 62(6): 1603-1612 (2014) - [c5]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT 2014: 176-181 - [c4]Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. ISCO 2014: 267-279 - 2013
- [j6]Fabio Furini, Enrico Malaguti:
Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput. Oper. Res. 40(8): 1953-1962 (2013) - [j5]Fabio Furini, Martin Philip Kidd:
A fast heuristic approach for train timetabling in a railway node. Electron. Notes Discret. Math. 41: 205-212 (2013) - [j4]Alberto Caprara, Fabio Furini, Enrico Malaguti:
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. Comput. 25(3): 560-571 (2013) - [c3]Fabio Furini, Emiliano Traversi:
Hybrid SDP Bounding Procedure. SEA 2013: 248-259 - 2012
- [j3]Fabio Furini:
Decomposition and reformulation of integer linear programming problems. 4OR 10(2): 219-220 (2012) - [j2]Fabio Furini, Enrico Malaguti:
Exact weighted vertex coloring via branch-and-price. Discret. Optim. 9(2): 130-136 (2012) - [j1]Fabio Furini, Enrico Malaguti, Rosa Medina Durán, Alfredo Persiani, Paolo Toth:
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur. J. Oper. Res. 218(1): 251-260 (2012) - [c2]Fabio Furini, Carlo Alfredo Persiani, Paolo Toth:
Aircraft Sequencing Problems via a Rolling Horizon Algorithm. ISCO 2012: 273-284 - 2011
- [b1]Fabio Furini:
Decomposition and reformulation of integer linear programming problems. University of Bologna, Italy, 2011 - [c1]Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint