Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Fabio Furini"'
Publikováno v:
European Journal of Operational Research. 307:1008-1025
Publikováno v:
Mathematical Programming. 196:9-56
We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a
Publikováno v:
Operations Research. 70:2399-2420
Exploiting Bilevel Optimization Techniques to Disconnect Graphs into Small Components In order to limit the spread of possible viral attacks in a communication or social network, it is necessary to identify critical nodes, the protection of which dis
Publikováno v:
European Journal of Operational Research. 299:448-467
A binary constraint satisfaction problem (BCSP) consists in determining an assignment of values to variables that is compatible with a set of constraints. The problem is called binary because the constraints involve only pairs of variables. The BCSP
Publikováno v:
Optimization Letters. 16:2333-2358
The aim of this letter is to design and computationally test several improvements for the compact integer linear programming (ILP) formulations of the temporal bin packing problem with fire-ups (TBPP-FU). This problem is a challenging generalization
Publikováno v:
European journal of operational research, 2021, Vol.294(1), pp.54-69 [Peer Reviewed Journal]
European journal of operational research 294 (2021): 54–69. doi:10.1016/j.ejor.2021.01.030
info:cnr-pdr/source/autori:Furini F.; Ljubic I.; San Segundo P.; Zhao Y./titolo:A branch-and-cut algorithm for the Edge Interdiction Clique Problem/doi:10.1016%2Fj.ejor.2021.01.030/rivista:European journal of operational research/anno:2021/pagina_da:54/pagina_a:69/intervallo_pagine:54–69/volume:294
European journal of operational research 294 (2021): 54–69. doi:10.1016/j.ejor.2021.01.030
info:cnr-pdr/source/autori:Furini F.; Ljubic I.; San Segundo P.; Zhao Y./titolo:A branch-and-cut algorithm for the Edge Interdiction Clique Problem/doi:10.1016%2Fj.ejor.2021.01.030/rivista:European journal of operational research/anno:2021/pagina_da:54/pagina_a:69/intervallo_pagine:54–69/volume:294
Given a graph G and an interdiction budget k ∈ N , the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50d98b64f5b3611f580ccd764eb6b09b
http://dro.dur.ac.uk/32473/
http://dro.dur.ac.uk/32473/
Autor:
Fabio, Furini1 fabio.furini@iasi.cnr.it, Ivana, Ljubić2 ivana.ljubic@essec.edu, Enrico, Malaguti3 enrico.malaguti@unibo.it, Paolo, Paronuzzi1 paolo.paronuzzi@unibo.it
Publikováno v:
Operations Research. Jul/Aug2022, Vol. 70 Issue 4, p2399-2420. 22p.
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2019, 278 (1), ⟨10.1016/j.ejor.2019.03.047⟩
Digital.CSIC. Repositorio Institucional del CSIC
instname
European journal of operational research 278 (2019): 76–90. doi:10.1016/j.ejor.2019.03.047
info:cnr-pdr/source/autori:San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana/titolo:A new branch-and-bound algorithm for the maximum edge-weighted clique problem/doi:10.1016%2Fj.ejor.2019.03.047/rivista:European journal of operational research/anno:2019/pagina_da:76/pagina_a:90/intervallo_pagine:76–90/volume:278
European Journal of Operational Research, Elsevier, 2019, 278 (1), ⟨10.1016/j.ejor.2019.03.047⟩
Digital.CSIC. Repositorio Institucional del CSIC
instname
European journal of operational research 278 (2019): 76–90. doi:10.1016/j.ejor.2019.03.047
info:cnr-pdr/source/autori:San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana/titolo:A new branch-and-bound algorithm for the maximum edge-weighted clique problem/doi:10.1016%2Fj.ejor.2019.03.047/rivista:European journal of operational research/anno:2019/pagina_da:76/pagina_a:90/intervallo_pagine:76–90/volume:278
We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range
Publikováno v:
Mathematical programming computation
12 (2020): 133–164. doi:10.1007/s12532-019-00167-1
info:cnr-pdr/source/autori:Furini F.; Ljubic I.; Malaguti E.; Paronuzzi P./titolo:On integer and bilevel formulations for the k-vertex cut problem/doi:10.1007%2Fs12532-019-00167-1/rivista:Mathematical programming computation (Print)/anno:2020/pagina_da:133/pagina_a:164/intervallo_pagine:133–164/volume:12
12 (2020): 133–164. doi:10.1007/s12532-019-00167-1
info:cnr-pdr/source/autori:Furini F.; Ljubic I.; Malaguti E.; Paronuzzi P./titolo:On integer and bilevel formulations for the k-vertex cut problem/doi:10.1007%2Fs12532-019-00167-1/rivista:Mathematical programming computation (Print)/anno:2020/pagina_da:133/pagina_a:164/intervallo_pagine:133–164/volume:12
The family of critical node detection problems asks for finding a subset of vertices, deletion of which minimizes or maximizes a predefined connectivity measure on the remaining network. We study a problem of this family called the k-vertex cut probl
Publikováno v:
Annals of Operations Research. 279:387-411
We perform a theoretical and computational study of the classical linearisation techniques (LT) and we propose a new LT for binary quadratic problems (BQPs). We discuss the relations between the linear programming (LP) relaxations of the considered L