Federico Malucelli

Federico Malucelli

Auto-generated profile, based on publicly available information

Federico Malucelli

Politecnico di Milano

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

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

Representative Publications

View All Publications
1 August 2008 in Computer Networks
Verified
Journal Article
Closed access
EAE. Amaldi
E. Amaldi
ACAntonio Capone
Antonio Capone
MCMatteo Cesana
Matteo Cesana
IFI. Filippini
I. Filippini
FMF. Malucelli
F. Malucelli

1 November 2013 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
FEFausto Errico
Fausto Errico
TCTeodor Gabriel Crainic
Teodor Gabriel Crainic
FMFederico Malucelli
Federico Malucelli
MNMaddalena Nonato
Maddalena Nonato

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

4 January 2007 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
EAEdoardo Amaldi
Edoardo Amaldi
ACAntonio Capone
Antonio Capone
FMFederico Malucelli
Federico Malucelli

1 August 2001 in Transportation Science
Verified
Journal Article
Closed access
SNSang Nguyen
Sang Nguyen
SPStefano Pallottino
Stefano Pallottino
FMFederico Malucelli
Federico Malucelli
This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.

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.