Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Furini, Fabio
54  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

A Numerically Exact Algorithm for the Bin-Packing Problem:

Baldacci, Roberto ; Coniglio, Stefano ; Cordeau, Jean-François.
INFORMS Journal on Computing.  36 (2024)  1 - p. 141-162 , 2024
Link: https://doi.org/10.1287/..
 
?
2

CliSAT: A new exact algorithm for hard maximum clique probl..:

San Segundo, Pablo ; Furini, Fabio ; Álvarez, David.
European Journal of Operational Research.  307 (2023)  3 - p. 1008-1025 , 2023
Link: https://doi.org/10.1016/..
 
?
3

A new branch-and-filter exact algorithm for binary constrai..:

San Segundo, Pablo ; Furini, Fabio ; León, Rafael
European Journal of Operational Research.  299 (2022)  2 - p. 448-467 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Submodular maximization of concave utility functions compos..:

Coniglio, Stefano ; Furini, Fabio ; Ljubić, Ivana
Mathematical Programming.  196 (2022)  1-2 - p. 9-56 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Preface: CTW 2018:

Furini, Fabio ; Lambert, Amélie ; Létocart, Lucas..
Discrete Applied Mathematics.  296 (2021)  - p. 1 , 2021
Link: https://doi.org/10.1016/..
 
?
6

A new combinatorial branch-and-bound algorithm for the Knap..:

Coniglio, Stefano ; Furini, Fabio ; San Segundo, Pablo
European Journal of Operational Research.  289 (2021)  2 - p. 435-455 , 2021
Link: https://doi.org/10.1016/..
 
?
7

A branch-and-cut algorithm for the Edge Interdiction Clique..:

Furini, Fabio ; Ljubić, Ivana ; San Segundo, Pablo.
European Journal of Operational Research.  294 (2021)  1 - p. 54-69 , 2021
Link: https://doi.org/10.1016/..
 
?
8

On the exact separation of cover inequalities of maximum-de..:

Catanzaro, Daniele ; Coniglio, Stefano ; Furini, Fabio
Optimization Letters.  16 (2021)  2 - p. 449-469 , 2021
Link: https://doi.org/10.1007/..
 
?
9

A Branch-and-Price Framework for Decomposing Graphs into Re..:

Gschwind, Timo ; Irnich, Stefan ; Furini, Fabio.
INFORMS Journal on Computing.  33 (2021)  3 - p. 1070-1090 , 2021
Link: https://doi.org/10.1287/..
 
?
10

Variable and constraint reduction techniques for the tempor..:

Martinovic, John ; Strasdat, Nico ; Valério de Carvalho, José.
Optimization Letters.  16 (2021)  8 - p. 2333-2358 , 2021
Link: https://doi.org/10.1007/..
 
?
11

A branch-and-price algorithm for the Minimum Sum Coloring P..:

Delle Donne, Diego ; Furini, Fabio ; Malaguti, Enrico.
Discrete Applied Mathematics.  303 (2021)  - p. 39-56 , 2021
Link: https://doi.org/10.1016/..
 
?
12

A branch-and-price algorithm for the temporal bin packing p..:

Dell'Amico, Mauro ; Furini, Fabio ; Iori, Manuel
Computers & Operations Research.  114 (2020)  - p. 104825 , 2020
Link: https://doi.org/10.1016/..
 
?
13

A new branch-and-bound algorithm for the Maximum Weighted C..:

San Segundo, Pablo ; Furini, Fabio ; Artieda, Jorge
Computers & Operations Research.  110 (2019)  - p. 18-33 , 2019
Link: https://doi.org/10.1016/..
 
?
14

The vertex k-cut problem:

Cornaz, Denis ; Furini, Fabio ; Lacroix, Mathieu...
Discrete Optimization.  31 (2019)  - p. 8-28 , 2019
Link: https://doi.org/10.1016/..
 
?
15

On integer and bilevel formulations for the k-vertex cut pr..:

Furini, Fabio ; Ljubić, Ivana ; Malaguti, Enrico.
Mathematical Programming Computation.  12 (2019)  2 - p. 133-164 , 2019
Link: https://doi.org/10.1007/..
 
1-15