Stefano Gualandi

Research

My profile on Google Scholar has basic citation metrics for my works, which are classified as follows:


Papers on International Journals

  1. B. Rostami, F. Malucelli, P. Belotti, S. Gualandi. Lower bounding procedure for the asymmetric quadratic traveling salesman problem. European Journal of Operational Research, vol. 253(3), pp. 584-592, 2016. [doi]
  2. M. Lombardi, S. Gualandi. A lagrangian propagator for artificial neural networks in constraint programming. Constraints, vol. 21(4), pp. 435-462, 2016. [doi]
  3. S. Carosi, S. Gualandi, F. Malucelli, E. Tresoldi. Delay Management in Public Transportation: Service Regularity Issues and Crew Re-scheduling. Transportation Research Procedia, vol. 10, pp. 483-492, 2015. [doi]
  4. G. Galbiati, S. Gualandi, and F. Maffioli. On minimum reload cost cycle cover. Discrete Applied Mathematics, vol. 164(1), pp. 112-120, 2014. [doi]
  5. E. Amaldi, S. Coniglio, S. Gualandi. Coordinated cutting plane generation via multi-objective separation. Mathematical Programming, vol. 143(1), pp. 87-110, 2014. [doi] [abstract] [preprint]
  6. S. Gualandi, F. Maffioli, C. Magni. Branch-and-price approach to the k-clustering minimum biclique completion problem. International Transactions in Operations Research, vol. 20(1), pp. 101-117, 2013. [doi]
  7. S. Gualandi, F. Malucelli. Constraint Programming-based Column Generation. Annals of Operations Research, vol. 204(1), pp. 11-32, 2013. [doi]
  8. M. Chiarandini, L. Di Gaspero, S. Gualandi, A. Schaerf. The Balanced Academic Curriculum Problem Revisited. Journal of Heuristics, vol. 18(1), pp. 119-148, 2012. [doi]
  9. S. Gualandi, F. Malucelli. A simple branching scheme for Vertex Coloring Problems. Discrete Applied Mathematics, vol. 160(1-2), pp. 192-196, 2012. [doi]
  10. S. Gualandi, F. Malucelli. Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation. INFORMS Journal on Computing, vol. 24(1), pp. 81-100, 2012. [doi]
  11. A. Capone, S. Gualandi, D. Yuan. Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding. Ad Hoc Networks Journal, vol. 9(7), pp. 1256-1269, 2011. [doi]
  12. A. Capone, L. Chen, S. Gualandi, D. Yuan. A New Computational Approach for Maximum Link Activation in Wireless Networks under the SINR Model. Transactions on Wireless Communications, vol. 10(5), pp. 1368-1372, 2011. [doi]
  13. F. Amigoni, S. Gualandi, D. Menotti, G. Sangiovanni. A multiagent architecture for controlling the Palamede satellite. Web Intelligence and Agent Systems: an International Journal, vol. 8(3), pp. 269-289, 2010. [doi]
  14. A. Capone, G. Carello, I. Filippini, S. Gualandi, F. Malucelli. Routing, Scheduling, and Channel Assignment in Wireless Mesh Networks: optimization models and algorithms. Ad Hoc Networks, vol. 8(6), pp. 545-563, 2010. [doi]
  15. A. Capone, G. Carello, I. Filippini, S. Gualandi, F. Malucelli. Solving a Resource Allocation Problem in Wireless Mesh Networks: a Comparison Between a CP-based and a Classical Column Generation. Networks, vol. 55(3), pp. 221-233, 2010. [doi]
  16. G. Galbiati, S. Gualandi, F. Maffioli. Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance. Networks, vol. 55(3), pp. 247-255, 2010. [doi]
  17. S. Gualandi. Enhancing CP-based Column Generation for Integer Programs. 4OR - A Quarterly Journal of Operations Research, vol. 7(3), pp. 289-292, 2009. [doi]
  18. S. Gualandi, F. Malucelli. Constraint Programming-based Column Generation: a Survey. Invited Survey. 4OR - A Quarterly Journal of Operations Research, vol. 7(2), pp. 113-137, 2009. [doi]

Papers on International Conferences (with peer review)

  1. G. Galbiati, S. Gualandi. Coloring of Paths into Forests. In Proc. of Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), vol. , pp. 113-116, 2013.
  2. S. Gualandi, M. Lombardi. A simple and effective decomposition for the multidimensional binpacking constraint. In Proc. of the International Conference on Principles and Practice of Constraint Programming (CP), vol. LNCS 8124, pp. 356-364, 2013. [doi]
  3. M. Lombardi, S. Gualandi.. A new propagator for two-layer neural networks in empirical model learning. In Proc. of the International Conference on Principles and Practice of Constraint Programming (CP), vol. LNCS 8124, pp. 448-463, 2013. [doi]
  4. B. Rostami, F. Malucelli, P. Belotti, S. Gualandi. Quadratic TSP: A lower bounding procedure and a column generation approach. In Proc. of Computer Science and Information Systems (FedCSIS), vol. , pp. 377-384, 2013.
  5. S. Gualandi, F. Malucelli. Resource constrained shortest paths with a super additive objective function. In Proc. of International Conference on Principles and Practice of Constraint Programming (CP), vol. LNCS 7514, pp. 299-315, 2012. [doi]
  6. P. Cremonesi, A. Sansottera, S. Gualandi. On the cooling-aware workload placement problem. In Proc. of Workshop on Artificial Intelligence for Data Center Management and Cloud Computing (AIDC), vol. , pp. 2-7, 2011. [pdf]
  7. P. Cremonesi, A. Sansottera, S. Gualandi. Optimizing cooling and server power consumption. In Proc. of IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), vol. , pp. 455-462, 2011. [doi]
  8. M. Chiarandini, G. Galbiati, S. Gualandi. Efficiency issues in the RLF heuristic for graph coloring. In Proc. of Metaheuristics International Conference (MIC), vol. , pp. 461-469, 2011. [pdf]
  9. F. Maffioli, G. Galbiati, S. Gualandi. On minimum changeover cost arborescences. In Proc. of International Symposium on Experimental Algorithms (SEA), vol. LNCS 6630, pp. 112-123, 2011. [doi]
  10. G. Sangiovanni, F. Amigoni, S. Gualandi. A multiagent system for efficient electrical energy management on the palamede satellite. In Proc. of International Power Electronics and Motion Control Conference, (EPE-PEMC), vol. , pp. 39-46, 2010.
  11. S. Gualandi, F. Malucelli. Weighted Biclique Completion via CP-SDP Randomized Rounding. In Proc. of European Workshop on Mixed Integer Nonlinear Programming (EWMINLP), vol. , pp. 223-230, 2010. [pdf]
  12. S. Gualandi, F. Maffioli, C. Magni. A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem. In Proc. of Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), vol. , pp. 69-72, 2010. [pdf]
  13. S. Gualandi, F. Malucelli, D. Sozzi. On the Design of the Fiber To The Home Networks. In Proc. of Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), vol. , pp. 65-68, 2010. [pdf]
  14. G. Galbiati, S. Gualandi, F. Maffioli. On minimum reload cost cycle cover. In Proc. of International Symposium on Combinatorial Optimization (ISCO). Electronic Notes in Discrete Mathematics, vol. 36, pp. 81-88, 2010. [doi]
  15. K. Dhyani, S. Gualandi, P. Cremonesi. A constraint programming approach for the service consolidation problem. In Proc. of International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), vol. LNCS 6140, pp. 97-101, 2010. [doi]
  16. S. Gualandi, F. Malucelli, D. Sozzi. On the Design of the Next Generation Access Networks. In Proc. of International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), vol. LNCS 6140, pp. 162-175, 2010. [doi]
  17. E. Amaldi, S. Coniglio, S. Gualandi. Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. In Proc. of International Symposium on Experimental Algorithms (SEA), vol. LNCS 6049, pp. 266-275, 2010. [doi]
  18. S. Gualandi, F. Malucelli. Graph Coloring via Constraint Programming-based Column Generation. In Proc. of International Network Optimization Conference (INOC), vol. , pp. 1-6, 2009. [pdf]
  19. S. Gualandi. k-Clustering Minimum Biclique Completion Via a Hybrid CP and SDP approach. In Proc. of International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), vol. LNCS 5547, pp. 87-101, 2009. [doi]

Workshop (without proceedings)

  1. S. Gualandi, L.M. Gambardella, A. De Maria. Dynamic Optimization of the Operations of a Robotic Arm. Italian Workshop on Neural Networks (WIRN), { paper.year }}.
  2. S. Gualandi, L.M. Gambardella, A. De Maria. Optimization Algorithms for Active Alignment of Fast Axis Collimating Lens. Italian Workshop on Neural Networks (WIRN), { paper.year }}.
  3. S. Gualandi, S. Coniglio. On the separation of rank inequalities for the max stable set problem. Combinatorial Optimization Workshop (18th), Aussois, { paper.year }}.
  4. S. Gualandi, F. Malucelli, S. Carosi, F. Bernazzani. Resource Constrained Shortest Paths with Side Constraints and Non Linear Costs. European Conference on Operational Research (EURO), { paper.year }}.
  5. M. Chiarandi, S. Gualandi. Towards Fair and Efficient Assignments of Students to Projects. International Conference on the Practice and Theory of Automated Timetabling (PATAT), { paper.year }}.
  6. S. Gualandi, F. Malucelli. Resource constrained shortest paths with a super additive objective function. International Symposium of Mathematical Programming (ISMP), { paper.year }}.
  7. S. Coniglio, S. Gualandi, E. Amaldi. (beyond) sequentially coordinated cutting plane generation for inequalities with integer coefficients. Mixed Integer Programming Workshop (MIP), { paper.year }}.
  8. S. Coniglio, S. Gualandi, E. Amaldi. Exact bi-criteria cutting plane generation for inequalities with 0-1 coefficients. Mixed Integer Programming Workshop (MIP), { paper.year }}.
  9. S. Gualandi, F. Malucelli. A CP-based column generation approach to scheduling for wireless mesh networks. Workshop for Doctoral Students at International Conference on Constraint Programming (CP), { paper.year }}.
  10. S. Bosio, G. Carello, S. Gualandi, F. Malucelli. A transmission scheduling problem in wireless networks. International Symposium of Mathematical Programming (ISMP), { paper.year }}.

Preprints Online

  • S. Coniglio, S. Gualandi. On the exact separation of rank inequalities for the maximum stable set problem. Optimization Online, pp. 1-20, 2014. [abstract] [preprint]
  • G. Galbiati, S. Gualandi, E. Traversi, F. Baumann. Complexity and Exact Solution Approaches to the Minimum Changeover Cost Arborescence Problem. Optimization Online, pp. 1-10, 2011. [abstract] [preprint]

Books - Translation

  • Italian Translation of: Bernhard Korte, Jens Vygen, Combinatorial Optimization - Theory and Algorithms, Springer Verlag. 670 pages. ISBN: 978-88-470-1522-7. [Link]

Book Chapter

  • A. Capone, I. Filippini, S. Gualandi, D. Yuan. Resource optimization in multiradio multichannel wireless mesh networks. , pp. 241-274, 2013. In editors: S. Basagni, M. Conti, S. Giordano, I. Stojmenovic. Mobile Ad hoc networking: the cutting edge directions. [abstract]