default search action
Stefano Coniglio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Roberto Baldacci
, Stefano Coniglio
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36(1): 141-162 (2024) - [c19]Stefano Fiorini, Stefano Coniglio
Graph Learning in 4D: A Quaternion-Valued Laplacian to Enhance Spectral GCNs. AAAI 2024: 12006-12015 - [i14]Stefano Fiorini, Giulia M. Bovolenta, Stefano Coniglio, Michele Ciavotta, Pietro Morerio, Michele Parrinello, Alessio Del Bue:
DLGNet: Hyperedge Classification through Directed Line Graphs for Chemical Reactions. CoRR abs/2410.06969 (2024) - [i13]David Benfield, Stefano Coniglio, Martin Kunc, Phan Tu Vuong, Alain B. Zemkoho:
Classification under strategic adversary manipulation using pessimistic bilevel optimisation. CoRR abs/2410.20284 (2024) - 2023
- [j24]Anthony J. Dunn, Stefano Coniglio
Deep learning and hyperparameter optimization for assessing one's eligibility for a subcutaneous implantable cardioverter-defibrillator. Ann. Oper. Res. 328(1): 309-335 (2023) - [j23]Endre Bjørndal, Mette Bjørndal, Stefano Coniglio
Energy storage operation and electricity market design: On the market power of monopolistic storage operators. Eur. J. Oper. Res. 307(2): 887-909 (2023) - [c18]Stefano Fiorini, Stefano Coniglio
SigMaNet: One Laplacian to Rule Them All. AAAI 2023: 7568-7576 - [i12]Stefano Fiorini, Stefano Coniglio, Michele Ciavotta, Enza Messina:
Graph Learning in 4D: a Quaternion-valued Laplacian to Enhance Spectral GCNs. CoRR abs/2312.17361 (2023) - 2022
- [j22]Stefano Coniglio
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming. INFORMS J. Comput. 34(2): 1006-1023 (2022) - [j21]Stefano Coniglio
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196(1): 9-56 (2022) - [j20]Daniele Catanzaro
On the exact separation of cover inequalities of maximum-depth. Optim. Lett. 16(2): 449-469 (2022) - [i11]Stefano Fiorini, Stefano Coniglio, Michele Ciavotta, Enza Messina:
SigMaNet: One Laplacian to Rule Them All. CoRR abs/2205.13459 (2022) - 2021
- [j19]Anthony J. Dunn, Mohamed H. ElRefai
Deep learning methods for screening patients' S-ICD implantation eligibility. Artif. Intell. Medicine 119: 102139 (2021) - [j18]Stefano Coniglio
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. Eur. J. Oper. Res. 289(2): 435-455 (2021) - [j17]Stefano Coniglio
Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets. OR Spectr. 43(2): 367-408 (2021) - [i10]Anthony J. Dunn, Mohamed H. ElRefai, Paul R. Roberts, Stefano Coniglio, Benedict M. Wiles, Alain B. Zemkoho
Deep learning methods for screening patients' S-ICD implantation eligibility. CoRR abs/2103.06021 (2021) - [i9]Suresh Bolusani, Stefano Coniglio, Ted K. Ralphs, Sahar Tahernejad:
A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization. CoRR abs/2104.09003 (2021) - 2020
- [j16]Stefano Coniglio
Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case. Algorithmica 82(5): 1189-1238 (2020) - [j15]Nicola Basilico
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games. EURO J. Comput. Optim. 8(1): 3-31 (2020) - [j14]Stefano Coniglio
Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming. IEEE/ACM Trans. Netw. 28(6): 2407-2420 (2020) - [c17]Andrea Celli, Stefano Coniglio
Private Bayesian Persuasion with Sequential Games. AAAI 2020: 1886-1893 - [i8]Stefano Coniglio, Anthony J. Dunn, Alain B. Zemkoho:
Infrequent adverse event prediction in low carbon energy production using machine learning. CoRR abs/2001.06916 (2020)
2010 – 2019
- 2019
- [j13]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Stefano Coniglio
Leadership in singleton congestion games: What is hard and what is easy. Artif. Intell. 277 (2019) - [j12]Pablo San Segundo
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1): 76-90 (2019) - [j11]Stefano Coniglio
A lexicographic pricer for the fractional bin packing problem. Oper. Res. Lett. 47(6): 622-628 (2019) - [c16]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games. AAMAS 2019: 909-917 - [i7]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Computing Optimal Coarse Correlated Equilibria in Sequential Games. CoRR abs/1901.06221 (2019) - [i6]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Bayesian Persuasion with Sequential Games. CoRR abs/1908.00877 (2019) - 2018
- [j10]Stefano Coniglio
Lot sizing with storage losses under demand uncertainty. J. Comb. Optim. 36(3): 763-788 (2018) - [c15]Alberto Marchesi, Stefano Coniglio
Leadership in Singleton Congestion Games. IJCAI 2018: 447-453 - [i5]Stefano Coniglio, Nicola Gatti, Alberto Marchesi:
Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case. CoRR abs/1808.01438 (2018) - [i4]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Stefano Coniglio:
Leadership in Singleton Congestion Games: What is Hard and What is Easy. CoRR abs/1808.10209 (2018) - 2017
- [j9]Ilio Catallo, Stefano Coniglio
A workload-dependent task assignment policy for crowdsourcing. World Wide Web 20(6): 1179-1210 (2017) - [c14]Stefano Coniglio
Pessimistic Leader-Follower Equilibria with Multiple Followers. IJCAI 2017: 171-177 - [c13]Stefano Coniglio
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem. SEA 2017: 29:1-29:13 - [c12]Nicola Basilico, Stefano Coniglio
Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria. SEA 2017: 31:1-31:14 - [e1]Tolga Bektas, Stefano Coniglio, Antonio Martinez-Sykora, Stefan Voß:
Computational Logistics - 8th International Conference, ICCL 2017, Southampton, UK, October 18-20, 2017, Proceedings. Lecture Notes in Computer Science 10572, Springer 2017, ISBN 978-3-319-68495-6 [contents] - [i3]Nicola Basilico, Stefano Coniglio, Nicola Gatti:
Methods for finding leader-follower equilibria with multiple followers. CoRR abs/1707.02174 (2017) - 2016
- [j8]Edoardo Amaldi, Stefano Coniglio
Discrete optimization methods to fit piecewise affine models to data points. Comput. Oper. Res. 75: 214-230 (2016) - [j7]Edoardo Amaldi, Stefano Coniglio
On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. 52: 213-220 (2016) - [j6]Stefano Coniglio
Data Uncertainty in Virtual Network Embedding: Robust Optimization and Protection Levels. J. Netw. Syst. Manag. 24(2): 681-710 (2016) - [c11]Nicola Basilico, Stefano Coniglio, Nicola Gatti:
Methods for Finding Leader-Follower Equilibria with Multiple Followers: (Extended Abstract). AAMAS 2016: 1363-1364 - [c10]Stefano Coniglio
On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration. ISCO 2016: 26-37 - 2015
- [c9]Stefano Coniglio
Virtual network embedding under uncertainty: Exact and heuristic approaches. DRCN 2015: 1-8 - [c8]Stefano Coniglio
On the Generation of Cutting Planes which Maximize the Bound Improvement. SEA 2015: 97-109 - [i2]Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster, Martin Tieves, Axel Werner:
Optimal offline virtual network embedding with rent-at-bulk aspects. CoRR abs/1501.07887 (2015) - 2014
- [j5]Edoardo Amaldi, Stefano Coniglio
Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1-2): 87-110 (2014) - [c7]Edoardo Amaldi, Stefano Coniglio
Maximum Throughput Network Routing Subject to Fair Flow Allocation. ISCO 2014: 1-12 - 2013
- [j4]Stefano Coniglio
On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints. 4OR 11(1): 95-96 (2013) - [j3]Edoardo Amaldi, Stefano Coniglio
On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discret. Math. 41: 543-550 (2013) - [j2]Edoardo Amaldi, Stefano Coniglio
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. Eur. J. Oper. Res. 227(1): 22-29 (2013) - [j1]Edoardo Amaldi, Antonio Capone
Network Optimization Problems Subject to Max-Min Fair Flow Allocation. IEEE Commun. Lett. 17(7): 1463-1466 (2013) - [c6]Edoardo Amaldi, Antonio Capone
Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation. CAMAD 2013: 169-174 - [i1]Stefano Coniglio:
Bound-optimal cutting planes. CTW 2013: 59-62 - 2012
- [c5]Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification. CTW 2012: 16-19 - 2011
- [c4]Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. CTW 2011: 48-51 - [c3]Stefano Coniglio:
The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations. CTW 2011: 118-121 - 2010
- [c2]Edoardo Amaldi, Stefano Coniglio
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA 2010: 266-275
2000 – 2009
- 2009
- [c1]Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani:
k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic. CTW 2009: 355-358
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: