default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Malucelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j58]Tommaso Schettini
, Michel Gendreau, Ola Jabali, Federico Malucelli:
A pattern-based timetabling strategy for a short-turning metro line. Public Transp. 16(1): 1-37 (2024)- [c27]Luca Pirolo, Pietro Belotti, Federico Malucelli, Rossella Moscarelli, Paolo Pileri:
Optimal Charging Station Location in a Linear Cycle Path with Deviations. ISCO 2024: 361-375 - 2023
- [j57]Davide Croci, Ola Jabali, Federico Malucelli:
The balanced p-median problem with unitary demand. Comput. Oper. Res. 155: 106242 (2023) - [j56]Tommaso Schettini, Federico Malucelli, Helena Ramalhinho:
Scheduling a pick and place packaging line. J. Sched. 26(2): 113-136 (2023) - [j55]Tommaso Schettini, Michel Gendreau, Ola Jabali, Federico Malucelli:
An Iterated Local Search Metaheuristic for the Capacitated Demand-Driven Timetabling Problem. Transp. Sci. 57(5): 1379-1401 (2023) - [i1]Mohsen Dastpak, Fausto Errico, Ola Jabali, Federico Malucelli:
Dynamic Routing for the Electric Vehicle Shortest Path Problem with Charging Station Occupancy Information. CoRR abs/2305.11773 (2023) - 2022
- [j54]Tommaso Schettini, Ola Jabali, Federico Malucelli:
A Benders decomposition algorithm for demand-driven metro scheduling. Comput. Oper. Res. 138: 105598 (2022) - [j53]Tommaso Schettini, Ola Jabali, Federico Malucelli:
Demand-Driven Timetabling for a Metro Corridor Using a Short-Turning Acceleration Strategy. Transp. Sci. 56(4): 919-937 (2022) - [c26]Antonio Cassia, Ola Jabali, Federico Malucelli, Marta Pascoal:
The electric vehicle shortest path problem with time windows and prize collection. FedCSIS 2022: 313-322 - [c25]Silvia Anna Cordieri, Francesca Fumero, Ola Jabali, Federico Malucelli:
The Long-Haul Transportation Problem with Refueling Deviations and Time-Dependent Travel Time. ICCL 2022: 245-259 - 2021
- [j52]Emanuele Tresoldi, Federico Malucelli, Maddalena Nonato:
A personalized walking bus service requiring optimized route decisions: A real case. Eur. J. Oper. Res. 289(3): 855-866 (2021) - [j51]Marianna Fornasiero, Federico Malucelli, Rodolfo Pazzi, Tommaso Schettini:
Empowering Optimization Skills Through an Orienteering Competition. INFORMS Trans. Educ. 22(1): 1-8 (2021) - [j50]Fausto Errico, Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato:
The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case. Transp. Sci. 55(6): 1300-1321 (2021) - 2020
- [j49]Marianna Fornasiero, Federico Malucelli:
Making high school students aware of optimization through games and puzzles. RAIRO Oper. Res. 54(2): 585-595 (2020)
2010 – 2019
- 2019
- [j48]Federico Malucelli, Emanuele Tresoldi:
Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study. Public Transp. 11(1): 1-25 (2019) - 2018
- [j47]Federico Malucelli, Emanuele Tresoldi, Maddalena Nonato:
Designing Pedibus Lines: a Path Based Approach. Electron. Notes Discret. Math. 69: 149-156 (2018) - [j46]Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk:
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268(2): 473-485 (2018) - [j45]Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case. Transp. Sci. 52(2): 277-299 (2018) - 2017
- [j44]Fausto Errico, Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato:
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems. Transp. Sci. 51(2): 706-722 (2017) - 2016
- [j43]Borzou Rostami, Federico Malucelli:
A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem. Electron. Notes Discret. Math. 55: 77-80 (2016) - [j42]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Eur. J. Oper. Res. 253(3): 584-592 (2016) - 2015
- [j41]Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, Federico Malucelli:
An application of constraint solving for home health care. AI Commun. 28(2): 215-237 (2015) - [j40]Borzou Rostami, Federico Malucelli:
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation. Comput. Oper. Res. 64: 178-188 (2015) - [c24]Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim:
On the Quadratic Shortest Path Problem. SEA 2015: 379-390 - 2014
- [j39]Borzou Rostami, Federico Malucelli:
A revised reformulation-linearization technique for the quadratic assignment problem. Discret. Optim. 14: 97-103 (2014) - [c23]Michele Mangili, Fabio Martignon, Antonio Capone, Federico Malucelli:
Content-aware planning models for information-centric networking. GLOBECOM 2014: 1854-1860 - 2013
- [j38]Stefano Gualandi, Federico Malucelli:
Constraint Programming-based Column Generation. Ann. Oper. Res. 204(1): 11-32 (2013) - [j37]Edoardo Amaldi, Federico Malucelli:
In memoriam of Francesco Maffioli (1941-2012). Int. Trans. Oper. Res. 20(3): 435-439 (2013) - [c22]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Quadratic TSP: A lower bounding procedure and a column generation approach. FedCSIS 2013: 377-384 - [p2]Borzou Rostami, Paolo Cremonesi, Federico Malucelli:
A Graph Optimization Approach to Item-Based Collaborative Filtering. Recent Advances in Computational Optimization 2013: 15-30 - 2012
- [j36]Teodor Gabriel Crainic, Fausto Errico, Federico Malucelli, Maddalena Nonato:
Designing the master schedule for demand-adaptive transit systems. Ann. Oper. Res. 194(1): 151-166 (2012) - [j35]Stefano Gualandi, Federico Malucelli:
A simple branching scheme for vertex coloring problems. Discret. Appl. Math. 160(1-2): 192-196 (2012) - [j34]Stefano Gualandi, Federico Malucelli:
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation. INFORMS J. Comput. 24(1): 81-100 (2012) - [j33]Edoardo Amaldi, Sandro Bosio, Federico Malucelli:
Hyperbolic set covering problems with competing ground-set elements. Math. Program. 134(2): 323-348 (2012) - [c21]Stefano Gualandi, Federico Malucelli:
Resource Constrained Shortest Paths with a Super Additive Objective Function. CP 2012: 299-315 - [c20]Federico Malucelli, Paolo Cremonesi, Borzou Rostami:
An Application of Bicriterion Shortest Paths to Collaborative Filtering. FedCSIS 2012: 423-429 - [c19]Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, Federico Malucelli:
Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit. ICLP (Technical Communications) 2012: 415-424 - 2011
- [j32]Edoardo Amaldi, Sandro Bosio, Federico Malucelli, Di Yuan:
Solving Nonlinear Covering Problems Arising in WLAN Design. Oper. Res. 59(1): 173-187 (2011) - [c18]Bernardetta Addis, Giuliana Carello, Federico Malucelli:
Network design with SRG based protection. CTW 2011: 27-31 - [c17]Bernardetta Addis, Giuliana Carello, Federico Malucelli:
SRG-Disjoint Design with Dedicated and Shared Protection. INOC 2011: 18-23 - 2010
- [j31]Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli:
Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms. Ad Hoc Networks 8(6): 545-563 (2010) - [j30]Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli:
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation. Networks 55(3): 221-233 (2010) - [c16]Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Fiber To The Home Networks. CTW 2010: 65-68 - [c15]Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Next Generation Access Networks. CPAIOR 2010: 162-175
2000 – 2009
- 2009
- [j29]Stefano Gualandi, Federico Malucelli:
Constraint programming-based column generation. 4OR 7(2): 113-137 (2009) - 2008
- [j28]Pietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli:
Multi-layer MPLS network design: The impact of statistical multiplexing. Comput. Networks 52(6): 1291-1307 (2008) - [j27]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini, Federico Malucelli:
Optimization models and methods for planning wireless mesh networks. Comput. Networks 52(11): 2159-2171 (2008) - [j26]Federico Malucelli, Stefano Pallottino, Daniele Pretolani:
The stack loading and unloading problem. Discret. Appl. Math. 156(17): 3248-3266 (2008) - [j25]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Radio planning and coverage optimization of 3G cellular networks. Wirel. Networks 14(4): 435-447 (2008) - [c14]Stefano Gualandi, Federico Malucelli:
Exact Graph Coloring via Hybrid Approaches. CTW 2008: 32-34 - 2007
- [j24]Federico Malucelli, Sara Nicoloso:
Shiftable intervals. Ann. Oper. Res. 150(1): 137-157 (2007) - [j23]Pietro Belotti, Federico Malucelli, Lorenzo Brunetta:
Multicommodity network design with discrete node costs. Networks 49(1): 90-99 (2007) - [c13]Stefano Secci, Alberto Ceselli, Federico Malucelli, Achille Pattavina, Brunilde Sansò:
Direct optimal design of a quasi-regular composite-star core network. DRCN 2007: 1-8 - [c12]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli:
Optimization Models for the Radio Planning of Wireless Mesh Networks. Networking 2007: 287-298 - 2006
- [j22]Edoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli:
Optimizing base station location and configuration in UMTS networks. Ann. Oper. Res. 146(1): 135-151 (2006) - [p1]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Carlo Mannino:
Optimization Problems and Models for Planning Cellular Networks. Handbook of Optimization in Telecommunications 2006: 917-939 - 2005
- [j21]Federico Malucelli, Sara Nicoloso:
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings. Electron. Notes Discret. Math. 22: 507-513 (2005) - [j20]Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato, François Guertin:
Meta-Heuristics for a Class of Demand-Responsive Transit Systems. INFORMS J. Comput. 17(1): 10-24 (2005) - 2004
- [j19]Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
An asymmetric vehicle routing problem arising in the collection and disposal of special waste. Electron. Notes Discret. Math. 17: 41-47 (2004) - [j18]Pietro Belotti, Federico Malucelli:
Network design with grooming constraints. Electron. Notes Discret. Math. 17: 51-56 (2004) - [j17]Lorenzo Brunetta, Federico Malucelli, Peter Värbrand, Di Yuan:
Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming. Telecommun. Syst. 26(1): 53-67 (2004) - [c11]Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
An Asymmetric Vehicle Routing Problem arising in the Collection and Disposal of Special Waste. CTW 2004: 41-46 - [c10]Pietro Belotti, Federico Malucelli:
Network Design with Grooming Constraints. CTW 2004: 51-55 - [c9]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli:
Algorithms for WLAN Coverage Planning. EuroNGI Workshop 2004: 52-65 - [c8]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli:
Optimizing WLAN radio coverage. ICC 2004: 180-184 - [c7]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Gianluca Villa:
Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms. ICC 2004: 4238-4242 - 2003
- [j16]Roberto Aringhieri, Pierre Hansen, Federico Malucelli:
Chemical trees enumeration algorithms. 4OR 1(1): 67-83 (2003) - [j15]Roberto Aringhieri, Federico Malucelli:
Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant. Ann. Oper. Res. 120(1-4): 173-199 (2003) - [j14]Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli:
The Base-matroid and Inverse Combinatorial Optimization Problems. Discret. Appl. Math. 128(2-3): 337-353 (2003) - [j13]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Discrete models and algorithms for packet scheduling in smart antennas. Electron. Notes Discret. Math. 13: 1-4 (2003) - [j12]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans. Wirel. Commun. 2(5): 939-952 (2003) - [c6]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori:
Radio Planning and Optimization of W-CDMA Systems. PWC 2003: 437-447 - [c5]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori:
Optimization models and algorithms for downlink UMTS radio planning. WCNC 2003: 827-831 - 2002
- [j11]Alberto Caprara, Federico Malucelli, Daniele Pretolani:
On bandwidth-2 graphs. Discret. Appl. Math. 117(1-3): 1-13 (2002) - [c4]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Optimizing UMTS radio coverage via base station configuration. PIMRC 2002: 315-319 - 2001
- [j10]Federico Malucelli, Sara Nicoloso:
Optimal partition of a bipartite graph into non-crossing matchings. Electron. Notes Discret. Math. 10: 187-191 (2001) - [j9]Roberto Aringhieri, Pierre Hansen, Federico Malucelli:
A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees. J. Chem. Inf. Comput. Sci. 41(4): 958-963 (2001) - [j8]Sang Nguyen, Stefano Pallottino, Federico Malucelli:
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables. Transp. Sci. 35(3): 238-249 (2001) - [c3]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Discrete models and algorithms for the capacitated location problems arising in UMTS network planning. DIAL-M 2001: 1-8 - [c2]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Improved models and algorithms for UMTS radio planning. VTC Fall 2001: 920-924 - 2000
- [j7]Federico Malucelli, Sara Nicoloso:
Shiftable Intervals. Electron. Notes Discret. Math. 5: 214-217 (2000)
1990 – 1999
- 1999
- [j6]Francesco Conti, Federico Malucelli, Sara Nicoloso, Bruno Simeone:
On a 2-dimensional equipartition problem. Eur. J. Oper. Res. 113(1): 215-231 (1999) - [j5]Paolo Carraresi, Fernanda Farinaccio, Federico Malucelli:
Testing optimality for quadratic 0-1 problems. Math. Program. 85(2): 407-421 (1999) - 1998
- [j4]Alessandra Esposito, M. S. Fiorenzo Catalano, Federico Malucelli, Luciano Tarricone:
A new matrix bandwidth reduction algorithm. Oper. Res. Lett. 23(3-5): 99-107 (1998) - 1995
- [j3]Paolo Carraresi, Federico Malucelli, Massimo Pappalardo:
Testing optimality for quadratic 0-1 unconstrained problems. Math. Methods Oper. Res. 42(3): 295-311 (1995) - 1993
- [j2]Federico Malucelli, Thomas Ottmann, Daniele Pretolani:
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. Discret. Appl. Math. 47(2): 175-179 (1993) - [c1]Paolo Carraresi, Federico Malucelli:
A Reformulation Scheme and New Lower Bounds for the QAP. Quadratic Assignment and Related Problems 1993: 147-160 - 1992
- [j1]Paolo Carraresi, Federico Malucelli:
A New Lower Bound for the Quadratic Assignment Problem. Oper. Res. 40(Supplement-1): S22-S27 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
