Следене
Stefano Coniglio
Заглавие
Позовавания
Позовавания
Година
On the computational complexity of the virtual network embedding problem
E Amaldi, S Coniglio, AMCA Koster, M Tieves
Electronic Notes in Discrete Mathematics 52, 213-220, 2016
1882016
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
S Coniglio, F Furini, P San Segundo
European Journal of Operational Research 289 (2), 435-455, 2021
622021
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
S Coniglio, F Furini, P San Segundo
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 289 (2), 435-455, 2021
622021
Network optimization problems subject to max-min fair flow allocation
E Amaldi, A Capone, S Coniglio, LG Gianoli
IEEE Communications Letters 17 (7), 1463-1466, 2013
532013
Coordinated cutting plane generation via multi-objective separation
E Amaldi, S Coniglio, S Gualandi
Mathematical Programming 143 (1-2), 87-110, 2014
352014
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
P San Segundo, S Coniglio, F Furini, I Ljubić
European Journal of Operational Research 278 (1), 76-90, 2019
322019
Pessimistic Leader-Follower Equilibria with Multiple Followers
S Coniglio, N Gatti, A Marchesi
Proceedings of the Twenty-Sixth International Joint Conference on Artificial …, 2017
312017
Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria
N Basilico, S Coniglio, N Gatti, A Marchesi
Leibniz International Proceedings in Informatics 75, 1-14, 2017
312017
Methods for Finding Leader-Follower Equilibria with Multiple Followers
N Basilico, S Coniglio, N Gatti
Proceedings of the 2016 International Conference on Autonomous Agents …, 2016
312016
Private bayesian persuasion with sequential games
A Celli, S Coniglio, N Gatti
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1886-1893, 2020
282020
Discrete optimization methods to fit piecewise affine models to data points
E Amaldi, S Coniglio, L Taccari
Computers & Operations Research 75, 214-230, 2016
242016
Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
S Coniglio, N Gatti, A Marchesi
Algorithmica 82 (5), 1189-1238, 2020
232020
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
N Basilico, S Coniglio, N Gatti, A Marchesi
EURO Journal on Computational Optimization 8 (1), 3-31, 2020
232020
Data uncertainty in virtual network embedding: Robust optimization and protection levels
S Coniglio, A Koster, M Tieves
Journal of Network and Systems Management 24 (3), 681-710, 2016
232016
On the Generation of Cutting Planes which Maximize the Bound Improvement
S Coniglio, M Tieves
Experimental Algorithms (14th International Symposium, SEA 2015, Paris …, 2015
232015
Leadership in singleton congestion games: What is hard and what is easy
M Castiglioni, A Marchesi, N Gatti, S Coniglio
Artificial Intelligence 277, 103177, 2019
222019
Leadership in Singleton Congestion Games
A Marchesi, S Coniglio, N Gatti
Proceedings of the Twenty-Seventh International Joint Conference on …, 2018
222018
Virtual network embedding under uncertainty: exact and heuristic approaches
S Coniglio, AMCA Koster, M Tieves
2015 11th International Conference on the Design of Reliable Communication …, 2015
222015
Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games
A Celli, S Coniglio, N Gatti
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
192019
On single-path network routing subject to max-min fair flow allocation
E Amaldi, S Coniglio, LG Gianoli, CU Ileri
Electronic Notes in Discrete Mathematics (6th International Network …, 2013
182013
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20