Malucelli Federico

Federico Malucelli

Information about the author Federico Malucelli will soon be added to the site.
Found 17 papers in total
Constraint Programming‐based Column Generation
2013
This paper surveys recent applications and advances of the Constraint...
Designing the master schedule for demand‐adaptive transit systems
2012
Demand‐Adaptive Systems (DASs) display features of both traditional...
Solving Nonlinear Covering Problems Arising in WLAN Design
2011
Wireless local area networks (WLANs) are widely used for cable replacement and...
Shiftable intervals
2007
Consider a set of n fixed length intervals and a set of n (larger) windows, in...
Optimizing base station location and configuration in UMTS networks
2006
Radio planning and coverage optimization are critical issues when deploying and...
Meta-heuristics for a class of demand-responsive transit systems
2005
The demand-adaptive systems studied in this paper attempt to offer demand-responsive...
Optimal operations management and network planning of a district heating system with a combined heat and power plant
2003
District heating plants are becoming more common in European cities. These systems...
A modeling framework for passenger assignment on a transport network with timetables
2001
This paper presents a new graph theoretic framework for the passenger assignment...
On a 2-dimensional equipartition problem
1999
The present paper deals with the following problem, which arises in a variety of...
Testing optimality for quadratic 0–1 problems
1999
We test whether a given solution of a quadratic 0–1 problem is optimal. The...
A polynomially solvable class of Quadratic Semi-Assignment Problems
1996
The Quadratic Semi-Assignment Problem (QSAP) models a large variety of practical...
Some thoughts on combinatorial optimisation
1995
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994,...
Lower bounds for the quadratic semi-assignment problem
1995
This paper presents a class of lower bounds for the Quadratic Semi-Assignment Problem...
Efficient labelling algorithms for the maximum noncrossing matching problem
1993
Consider a bipartite graph; let’s suppose the origin nodes and the destination...
A new lower bound for the quadratic assignment problem
1992
The authors introduce a new lower bound for the quadratic assignment problem based on...
Quadratic assignment problems
1988
Quadratic assignment problems have many interesting applications in practice, but they...
Papers per page: