Stefano Coniglio

According to our database1, Stefano Coniglio authored at least 39 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games.
EURO J. Comput. Optim., 2020

Infrequent adverse event prediction in low carbon energy production using machine learning.
CoRR, 2020

Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case.
Algorithmica, 2020

Private Bayesian Persuasion with Sequential Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A lexicographic pricer for the fractional bin packing problem.
Oper. Res. Lett., 2019

A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Eur. J. Oper. Res., 2019

Bayesian Persuasion with Sequential Games.
CoRR, 2019

Computing Optimal Coarse Correlated Equilibria in Sequential Games.
CoRR, 2019

Leadership in singleton congestion games: What is hard and what is easy.
Artif. Intell., 2019

Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Lot sizing with storage losses under demand uncertainty.
J. Comb. Optim., 2018

Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case.
CoRR, 2018

Leadership in Singleton Congestion Games.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
A workload-dependent task assignment policy for crowdsourcing.
World Wide Web, 2017

Methods for finding leader-follower equilibria with multiple followers.
CoRR, 2017

On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Pessimistic Leader-Follower Equilibria with Multiple Followers.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels.
J. Netw. Syst. Manag., 2016

On the computational complexity of the virtual network embedding problem.
Electron. Notes Discret. Math., 2016

Discrete optimization methods to fit piecewise affine models to data points.
Comput. Oper. Res., 2016

On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Methods for Finding Leader-Follower Equilibria with Multiple Followers: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Optimal offline virtual network embedding with rent-at-bulk aspects.
CoRR, 2015

On the Generation of Cutting Planes which Maximize the Bound Improvement.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Virtual network embedding under uncertainty: Exact and heuristic approaches.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

2014
Coordinated cutting plane generation via multi-objective separation.
Math. Program., 2014

Maximum Throughput Network Routing Subject to Fair Flow Allocation.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Network Optimization Problems Subject to Max-Min Fair Flow Allocation.
IEEE Commun. Lett., 2013

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem.
Eur. J. Oper. Res., 2013

On single-path network routing subject to max-min fair flow allocation.
Electron. Notes Discret. Math., 2013

On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints.
4OR, 2013

Bound-optimal cutting planes.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation.
Proceedings of the IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2013

2012
k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Formulations and heuristics for the k-Piecewise Affine Model Fitting problem.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009


  Loading...