The University of Southampton

×

Phone:: (023) 8059 4546
Email:: S.Coniglio@soton.ac.uk

Dr Stefano Coniglio PhD

Lecturer in Operational Research

Related links: Personal homepage

Dr Stefano Coniglio is a Lecturer in Operational Research within Mathematical Sciences at the University of Southampton.

Background

Dr Stefano Coniglio joined the University of Southampton as Lecturer in Operational Research within Mathematical Sciences in February 2016. Prior to that, he served as Research Associate at the RWTH Aachen University, Germany, and as Postdoctoral Researcher at Politecnico di Milano, Italy, where he received his Ph.D. in Information Technology in 2011.

His research focuses on exact methods for the solution of mathematical programming and combinatorial optimization problems. Recently, he has been most active in bilevel programming, robust optimization, and methodological aspects of cutting plane generation, with applications to algorithmic game theory, optimization in telecommunication networks, energy production planning, and data mining.

Research

Publications

Teaching

Contact

Research interests

Associated: Computational optimization, Decision making under uncertainty, Discrete Optimization, Multilevel optimization

Research group

Operational Research

Articles

Catallo, I., Coniglio, S., Fraternali, P., & Martinenghi, D. (2017). A workload-dependent task assignment policy for crowdsourcing. World Wide Web. DOI: 10.1007/s11280-016-0428-7
Coniglio, S., Koster, A., & Spiekermann, N. (2017). Lot sizing with storage losses under demand uncertainty. Journal of Combinatorial Optimization. DOI: 10.1007/s10878-017-0147-8
Coniglio, S., Koster, A., & Tieves, M. (2016). Data uncertainty in virtual network embedding: robust optimization and protection levels. Journal of Network and Systems Management, 24(3), 681-710. DOI: 10.1007/s10922-016-9376-x
Amaldi, E., Coniglio, S., & Taccari, L. (2016). Discrete optimization methods to fit piecewise affine models to data points. Computers & Operations Research, 75, 214-230. DOI: 10.1016/j.cor.2016.05.001
Coniglio, S., Koster, A., & Spiekermann, N. (2016). On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration. Lecture Notes in Computer Science, 1-12.
Amaldi, E., Coniglio, S., & Gualandi, S. (2014). Coordinated cutting plane generation via multi-objective separation. Mathematical Programming, 143(1-2), 87-110. DOI: 10.1007/s10107-012-0596-x
Amaldi, E., & Coniglio, S. (2013). A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. European Journal of Operational Research, 227(1), 22-29.
Amaldi, E., Capone, A., Coniglio, S., & Gianoli, L. G. (2013). Network optimization problems subject to max-min fair flow allocation. IEEE Communications Letters, 17(7), 1463-1466.
Coniglio, S. (2013). On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints. 4OR, 11(1), 95-96.

Conferences

Basilico, N., Coniglio, S., Gatti, N., & Marchesi, A. (2017). Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria. In C. S. Iliopoulos, S. P. Pissis, S. J. Puglisi, & R. Raman (Eds.), 16th Symposium on Experimental Algorithms: SEA 2017 (Vol. 75, pp. 31:1-31:14). (LIPICS). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. DOI: 10.4230/LIPIcs.SEA.2017.31
Fliege, J., Coniglio, S., & Walton, R. (2017). Facility location with item storage and delivery. In A. Sforza, & C. Sterle (Eds.), Optimization and Decision Science: Methodologies and Applications (pp. 287-294). (Springer Proceedings in Mathematics & Statistics ). Cham: Springer. DOI: 10.1007/978-3-319-67308-0_29
Coniglio, S., & Gualandi, S. (2017). On the separation of topology-free rank inequalities for the max stable set problem. In LIPIcs-Leibniz International Proceedings in Informatics (Vol. 75). DOI: 10.4230/LIPIcs.SEA.2017.29
Coniglio, S., Gatti, N., & Marchesi, A. (2017). Pessimistic leader-follower equilibria with multiple followers. In IJCAI (pp. 171-177)
Basilico, N., Coniglio, S., & Gatti, N. (2016). Methods for finding leader-follower equilibria with multiple followers. In Proceedings of the 2016 International Conference on Autonomous Agents Multiagent Systems (pp. 1363-1364)
Coniglio, S., Amaldi, E., Koster, A., & Tieves, M. (2016). On the computational complexity of the virtual network embedding problem. In Electronic notes in discrete mathematics (Vol. 52, pp. 213). Elsevier. DOI: 0.1016/j.endm.2016.03.028
Coniglio, S., & Tieves, M. (2015). On the Generation of Cutting Planes which Maximize the Bound Improvement. In E. Bampis (Ed.), Experimental Algorithms: 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings (Vol. 9125, pp. 97-109). (Theoretical Computer Science and General Issues; Vol. 9125). Springer. DOI: 10.1007/978-3-319-20086-6
Coniglio, S., Koster, A. M. C. A., & Tieves, M. (2015). Virtual network embedding under uncertainty: Exact and heuristic approaches. In 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN) (pp. 1-8). IEEE. DOI: 10.1109/DRCN.2015.7148978
Amaldi, E., Coniglio, S., & Taccari, L. (2014). Maximum Throughput Network Routing Subject to Fair Flow Allocation. In Combinatorial Optimization, LNCS (Proc. of 3rd International Symposium on Combinatorial Optimization, ISCO) (pp. 1-12)
Coniglio, S. (2013). Bound-optimal cutting planes. In Graphs and Combinatorial Optimization (CTW), 12th Cologne-Twente Workshop on (pp. 59-62)
Amaldi, E., Capone, A., Coniglio, S., & Gianoli, L. G. (2013). Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation. In Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2013 IEEE 18th International Workshop on (pp. 169-174)
Amaldi, E., Coniglio, S., Gianoli, L. G., & Ileri, C. U. (2013). On single-path network routing subject to max-min fair flow allocation. In Electronic Notes in Discrete Mathematics (6th International Network Optimization Conference, INOC 2013) (Vol. 41, pp. 543-550)
Amaldi, E., Coniglio, S., & Taccari, L. (2012). k-piecewise affine model fitting: heuristics based on multiway linear classification. In Graphs and Combinatorial Optimization (CTW), 11th Cologne-Twente Workshop on
Amaldi, E., Coniglio, S., & Taccari, L. (2011). Formulations and heuristics for the k-piecewise affine model fitting problem. In Graphs and Combinatorial Optimization (CTW), 10th Cologne-Twente Workshop on (pp. 48-51)
Coniglio, S. (2011). The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations. In Graphs and Combinatorial Optimization (CTW), 10th Cologne-Twente Workshop on (pp. 118-121)
Amaldi, E., Coniglio, S., & Gualandi, S. (2010). Improving cutting plane generation with 0-1 inequalities by bi-criteria separation. In Experimental Algorithms (9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings) (Vol. 6049, pp. 266-275)
Amaldi, E., Coniglio, S., & Iuliano, C. (2010). Optimization models for injured people evacuation in medium/maxi health-care emergencies. In Health Care Management (WHCM), 2010 IEEE Workshop on (pp. 1-6)
Amaldi, E., Coniglio, S., & Iuliano, C. (2010). Single and multi-group evacuation in medium and maxi health-care emergencies. In Operations Research for Patient. Centered Health Care Delivery. Proceedings of the XXXVI International ORAHS Conference (pp. 155)
Amaldi, E., & Coniglio, S. (2009). An adaptive point-reassignment metaheuristic for the k-hyperplane clustering problem. In 8th Metaheuristc International Conference, Hamburg, Germany
Amaldi, E., Coniglio, S., & Dhyani, K. (2009). k-hyperplane clustering problem: column generation and a metaheuristic. In Graphs and Combinatorial Optimization (CTW), 8th Cologne-Twente Workshop on (pp. 355-368)

MATH2014 Algorithms

Dr Stefano Coniglio
Building 54 Mathematical Sciences University of Southampton Highfield Southampton SO17 1BJ

Room Number:54/10001

Dr Stefano Coniglio's personal home page

Share this profile Share this on Facebook Share this on Google+ Share this on Twitter Share this on Weibo

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×