Federico Malucelli

Orcid: 0000-0003-0034-1721

According to our database1, Federico Malucelli authored at least 83 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A pattern-based timetabling strategy for a short-turning metro line.
Public Transp., March, 2024

2023
An Iterated Local Search Metaheuristic for the Capacitated Demand-Driven Timetabling Problem.
Transp. Sci., September, 2023

The balanced p-median problem with unitary demand.
Comput. Oper. Res., July, 2023

Scheduling a pick and place packaging line.
J. Sched., 2023

Dynamic Routing for the Electric Vehicle Shortest Path Problem with Charging Station Occupancy Information.
CoRR, 2023

2022
Demand-Driven Timetabling for a Metro Corridor Using a Short-Turning Acceleration Strategy.
Transp. Sci., 2022

A Benders decomposition algorithm for demand-driven metro scheduling.
Comput. Oper. Res., 2022

The Long-Haul Transportation Problem with Refueling Deviations and Time-Dependent Travel Time.
Proceedings of the Computational Logistics - 13th International Conference, 2022

The electric vehicle shortest path problem with time windows and prize collection.
Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021
The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case.
Transp. Sci., 2021

Empowering Optimization Skills Through an Orienteering Competition.
INFORMS Trans. Educ., 2021

A personalized walking bus service requiring optimized route decisions: A real case.
Eur. J. Oper. Res., 2021

2020
Making high school students aware of optimization through games and puzzles.
RAIRO Oper. Res., 2020

2019
Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study.
Public Transp., 2019

2018
A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case.
Transp. Sci., 2018

The quadratic shortest path problem: complexity, approximability, and solution methods.
Eur. J. Oper. Res., 2018

Designing Pedibus Lines: a Path Based Approach.
Electron. Notes Discret. Math., 2018

2017
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems.
Transp. Sci., 2017

2016
Lower bounding procedure for the asymmetric quadratic traveling salesman problem.
Eur. J. Oper. Res., 2016

A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem.
Electron. Notes Discret. Math., 2016

2015
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation.
Comput. Oper. Res., 2015

An application of constraint solving for home health care.
AI Commun., 2015

On the Quadratic Shortest Path Problem.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
A revised reformulation-linearization technique for the quadratic assignment problem.
Discret. Optim., 2014

Content-aware planning models for information-centric networking.
Proceedings of the IEEE Global Communications Conference, 2014

2013
A Graph Optimization Approach to Item-Based Collaborative Filtering.
Proceedings of the Recent Advances in Computational Optimization, 2013

In memoriam of Francesco Maffioli (1941-2012).
Int. Trans. Oper. Res., 2013

Constraint Programming-based Column Generation.
Ann. Oper. Res., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
Hyperbolic set covering problems with competing ground-set elements.
Math. Program., 2012

Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation.
INFORMS J. Comput., 2012

A simple branching scheme for vertex coloring problems.
Discret. Appl. Math., 2012

Designing the master schedule for demand-adaptive transit systems.
Ann. Oper. Res., 2012

Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

An Application of Bicriterion Shortest Paths to Collaborative Filtering.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Resource Constrained Shortest Paths with a Super Additive Objective Function.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Solving Nonlinear Covering Problems Arising in WLAN Design.
Oper. Res., 2011

SRG-Disjoint Design with Dedicated and Shared Protection.
Proceedings of the Network Optimization - 5th International Conference, 2011

Network design with SRG based protection.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation.
Networks, 2010

Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms.
Ad Hoc Networks, 2010

On the Design of the Next Generation Access Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

On the Design of the Fiber To The Home Networks.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2008
Radio planning and coverage optimization of 3G cellular networks.
Wirel. Networks, 2008

The stack loading and unloading problem.
Discret. Appl. Math., 2008

Multi-layer MPLS network design: The impact of statistical multiplexing.
Comput. Networks, 2008

Optimization models and methods for planning wireless mesh networks.
Comput. Networks, 2008

Exact Graph Coloring via Hybrid Approaches.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Multicommodity network design with discrete node costs.
Networks, 2007

Optimization Models for the Radio Planning of Wireless Mesh Networks.
Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Direct optimal design of a quasi-regular composite-star core network.
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006
Optimizing base station location and configuration in UMTS networks.
Ann. Oper. Res., 2006

Optimization Problems and Models for Planning Cellular Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Meta-Heuristics for a Class of Demand-Responsive Transit Systems.
INFORMS J. Comput., 2005

Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.
Electron. Notes Discret. Math., 2005

2004
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming.
Telecommun. Syst., 2004

Network design with grooming constraints.
Electron. Notes Discret. Math., 2004

An asymmetric vehicle routing problem arising in the collection and disposal of special waste.
Electron. Notes Discret. Math., 2004

Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms.
Proceedings of IEEE International Conference on Communications, 2004

Optimizing WLAN radio coverage.
Proceedings of IEEE International Conference on Communications, 2004

Algorithms for WLAN Coverage Planning.
Proceedings of the Wireless Systems and Mobility in Next Generation Internet, 2004

2003
Planning UMTS base station location: optimization models with power control and algorithms.
IEEE Trans. Wirel. Commun., 2003

Discrete models and algorithms for packet scheduling in smart antennas.
Electron. Notes Discret. Math., 2003

The Base-matroid and Inverse Combinatorial Optimization Problems.
Discret. Appl. Math., 2003

Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant.
Ann. Oper. Res., 2003

Chemical trees enumeration algorithms.
4OR, 2003

Optimization models and algorithms for downlink UMTS radio planning.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

Radio Planning and Optimization of W-CDMA Systems.
Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003

2002
On bandwidth-2 graphs.
Discret. Appl. Math., 2002

Optimizing UMTS radio coverage via base station configuration.
Proceedings of the 13th IEEE International Symposium on Personal, 2002

2001
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables.
Transp. Sci., 2001

A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees.
J. Chem. Inf. Comput. Sci., 2001

Optimal partition of a bipartite graph into non-crossing matchings.
Electron. Notes Discret. Math., 2001

Improved models and algorithms for UMTS radio planning.
Proceedings of the 54th IEEE Vehicular Technology Conference, 2001

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Shiftable Intervals.
Electron. Notes Discret. Math., 2000

1999
Testing optimality for quadratic 0-1 problems.
Math. Program., 1999

On a 2-dimensional equipartition problem.
Eur. J. Oper. Res., 1999

1998
A new matrix bandwidth reduction algorithm.
Oper. Res. Lett., 1998

1995
Testing optimality for quadratic 0-1 unconstrained problems.
Math. Methods Oper. Res., 1995

1993
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
Discret. Appl. Math., 1993

A Reformulation Scheme and New Lower Bounds for the QAP.
Proceedings of the Quadratic Assignment and Related Problems, 1993

1992
A New Lower Bound for the Quadratic Assignment Problem.
Oper. Res., 1992


  Loading...