logo
科言猫学术研究的AI总结
language
手机端手机端
  • Phone Feature微信小程序
简体中文简体中文
notice消息通知
博客博客
delete
arrow
返回
F

Fabio Furini

sapienza university of rome

22H指数
88论文数
1.5K被引数
收录论文 24
发表时间
logo
An exact approach for the Train Single-Routing Selection Problem针对列车单路径选择问题的精确求解方法
errEuropean Journal of Operational Research
IF6
err2026-08-29
err0
PREAI
errAnna Livia Croella; Fabio Furini; Ivana Ljubić; Bianca Pascariu; Paola Pellegrini; Pablo San Segundo
err分享
err收藏
Integer linear programming formulations for the maximum flow blocker problem整数线性规划模型用于最大流阻断问题
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2025-02-01
err0
PREAI
errBentoumi, Isma; Furini, Fabio; Mahjoub, A. Ridha; Martin, Sebastien
err分享
err收藏
CliSAT: A new exact algorithm for hard maximum clique problemsCliSAT: 硬最大团问题的一种新的精确算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2023-06-01
err1
errOAAI
errSan Segundo, Pablo; Furini, Fabio; Alvarez, David; Pardalos, Panos M.
err分享
err收藏
A combinatorial flow-based formulation for temporal bin packing problems用于时间装箱问题的基于组合流的公式
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2023-06-01
err8
PREAI
errMartinovic, J.; Strasdat, N.; de Carvalho, J. Valerio; Furini, F.
err分享
err收藏
A new branch-and-filter exact algorithm for binary constraint satisfaction problems求解二元约束满足问题的一种新的分支和过滤精确算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2022-06-01
err3
errOAAI
errSan Segundo, Pablo; Furini, Fabio; Leon, Rafael
err分享
err收藏
A branch-and-cut algorithm for the Edge Interdiction Clique Problem边缘遮断团问题的分支割算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2021-10-01
err14
errOAAI
errFurini, Fabio; Ljubic, Ivana; San Segundo, Pablo; Zhao, Yanlu
err分享
err收藏
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts带冲突背包问题的一种新的组合分支定界算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2021-03-01
err44
errOAAI
errConiglio, Stefano; Furini, Fabio; San Segundo, Pablo
err分享
err收藏
A branch-and-price algorithm for the temporal bin packing problem一种求解时态装箱问题的分支-价格算法
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2020-02-01
err40
errOAAI
errDell'Amico, Mauro; Furini, Fabio; Iori, Manuel
err分享
err收藏
Preface: decomposition methods for hard optimization problems
errANNALS OF OPERATIONS RESEARCH
IF4.5
err2019-10-31
err0
PREAI
errFurini, Fabio; Ljubic, Ivana; Traversi, Emiliano
err分享
err收藏
A new branch-and-bound algorithm for the maximum edge-weighted clique problem最大边加权团问题的一种新的分支定界算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2019-10-01
err18
errOAAI
errSan Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana
err分享
err收藏
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem最大加权团问题的一种新的分支定界算法
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2019-10-01
err11
errOAAI
errSan Segundo, Pablo; Furini, Fabio; Artieda, Jorge
err分享
err收藏
The maximum clique interdiction problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2019-08-01
err28
errOAAI
errFurini, Fabio; Ljubic, Ivana; Martin, Sebastien; San Segundo, Pablo
err分享
err收藏
On integer and bilevel formulations for the k-vertex cut problem关于k顶点切割问题的整数和两级公式
errMATHEMATICAL PROGRAMMING COMPUTATION
IF3.6
err2019-07-31
err18
errOAAI
errFurini, Fabio; Ljubic, Ivana; Malaguti, Enrico; Paronuzzi, Paolo
err分享
err收藏
Benders decomposition for very large scale partial set covering and maximal covering location problems超大规模部分集合覆盖和最大覆盖位置问题的Benders分解
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2019-06-01
err70
errOAAI
errCordeau, Jean-Francois; Furini, Fabio; Ljubic, Ivana
err分享
err收藏
Tighter MIP models for Barge Container Ship Routing驳船集装箱船路由的更严格的MIP模型
errOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
IF7.2
err2019-01-01
err23
errOAAI
errAlfandari, Laurent; Davidovic, Tatjana; Furini, Fabio; Ljubic, Ivana; Maras, Vladislav; Martin, Sebastien
err分享
err收藏
Theoretical and computational study of several linearisation techniques for binary quadratic problems二元二次问题的几种线性化技术的理论和计算研究
errANNALS OF OPERATIONS RESEARCH
IF4.5
err2018-12-17
err13
PREAI
errFurini, Fabio; Traversi, Emiliano
err分享
err收藏
QPLIB: a library of quadratic programming instancesQPLIB: 一个二次规划实例库
errMATHEMATICAL PROGRAMMING COMPUTATION
IF3.6
err2018-09-22
err49
errOAAI
errFurini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos, V; Vigerske, Stefan; Wiegele, Angelika
err分享
err收藏
An exact algorithm for the Partition Coloring Problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2018-04-01
err15
errOAAI
errFurini, Fabio; Malaguti, Enrico; Santini, Alberto
err分享
err收藏
Exact approaches for the knapsack problem with setups带设置的背包问题的精确方法
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2018-02-01
err30
errOAAI
errFurini, Fabio; Monaci, Michele; Traversi, Emiliano
err分享
err收藏
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem求解最小费用最大背包装箱问题的一种有效动态规划算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2017-10-01
err22
PREAI
errFurini, Fabio; Ljubic, Ivana; Sinnl, Markus
err分享
err收藏

研究方向

暂无研究方向
合作学者
合作期刊
P
Paolo Toth
H 指数: 80 · 论文数: 272
P
Pãnos M. Pardalos
H 指数: 78 · 论文数: 840
J
Jean‐François Cordeau
H 指数: 67 · 论文数: 245
N
Nikolaos V. Sahinidis
H 指数: 55 · 论文数: 251
A
Andrea Lodi
H 指数: 55 · 论文数: 505
查看更多