Stefano Gualandi

Stefano Gualandi

Auto-generated profile, based on publicly available information

Stefano Gualandi

University of Pavia

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2010 in Ad Hoc Networks
Verified
Journal Article
Closed access
ACAntonio Capone
Antonio Capone
GCG. Carello
G. Carello
IFI. Filippini
I. Filippini
SGS. Gualandi
S. Gualandi
FMF. Malucelli
F. Malucelli

1 February 2012 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
SGStefano Gualandi
Stefano Gualandi
FMFederico Malucelli
Federico Malucelli
We consider two approaches for solving the classical minimum vertex coloring problem—that is, the problem of coloring the vertices of a graph so that adjacent vertices have different colors and minimizing the number of used colors—namely, constraint programming and column generation. Constraint programming is able to solve very efficiently many of the benchmarks but suffers from a lack of effective bounding methods. On the contrary, column generation provides tight lower bounds by solving the fractional vertex coloring problem exploited in a branch-and-price algorithm, as already proposed in the literature. The column generation approach is here enhanced by using constraint programming to solve the pricing subproblem and to compute heuristic solutions. Moreover, new techniques are introduced to improve the performance of the column generation approach in solving both the linear relaxation and the integer problem. We report extensive computational results applied to the benchmark instances: we are able to prove optimality of 11 new instances and to improve the best-known lower bounds on 17 other instances. Moreover, we extend the solution approaches to a generalization of the problem known as the minimum vertex graph multicoloring problem, where a given number of colors has to be assigned to each vertex.

29 April 2019 in Mathematical Models and Methods in Applied Sciences
Verified
Journal Article
Closed access
SGStefano Gualandi
Stefano Gualandi
GTGiuseppe Toscani
Giuseppe Toscani

15 July 2018 in Mathematical Models and Methods in Applied Sciences
Verified
Journal Article
Closed access
SGStefano Gualandi
Stefano Gualandi
GTGiuseppe Toscani
Giuseppe Toscani

7 March 2011 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ACAntonio Capone
Antonio Capone
LCLei Chen
Lei Chen
SGStefano Gualandi
Stefano Gualandi
DYDi Yuan
Di Yuan
A fundamental and computationally challenging optimization task in wireless networks is to maximize the number of simultaneous transmissions, subject to signal-to-noise-and-interference ratio (SINR) requirements at the receivers. The conventional approach guaranteeing global optimality is to solve an integer programming model with explicit SINR constraints. These constraints are however numerically very difficult. We develop a new integer programming algorithm based on a much more effective representation of the SINR constraints. Computational experiments demonstrate that the new approach performs significantly better in proving optimality.

18 November 2017 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
MCMarco Chiarandini
Marco Chiarandini
RFRolf Fagerberg
Rolf Fagerberg
SGStefano Gualandi
Stefano Gualandi