Stefano Coniglio

On the computational complexity of the virtual network embedding problem

E. Amaldi, Stefano Coniglio, Arie M. C. A. Koster et al. · Electronic Notes in Discrete Mathematics · 2016 · 147 citations · Full text

Mathematical Programming, Network Virtualization, Network Science +12

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

Stefano Coniglio, Fabio Furini, Pablo San Segundo · European Journal of Operational Research · 2020 · 72 citations · Full text

Mathematical Programming, Branch-and-bound Algorithm, Mechanism Design +13

Network Optimization Problems Subject to Max-Min Fair Flow Allocation

E. Amaldi, Antonio Capone, Stefano Coniglio et al. · IEEE Communications Letters · 2013 · 44 citations

Mathematical Programming, Congestion Management, Network Science +15

Energy storage operation and electricity market design: On the market power of monopolistic storage operators

Endre Bjørndal, Mette Bjørndal, Stefano Coniglio et al. · European Journal of Operational Research · 2022 · 43 citations

Power Market, Economics, Electrical Engineering +10

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Pablo San Segundo, Stefano Coniglio, Fabio Furini et al. · European Journal of Operational Research · 2019 · 28 citations · Full text

Mathematical Programming, Branch-and-bound Algorithm, New Branch-and-bound Algorithm +14