default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurizio Bruglieri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Maurizio Bruglieri
, Roberto Peruzzini, Ornella Pisacane:
Efficiently routing a fleet of autonomous vehicles in a real-time ride-sharing system. Comput. Oper. Res. 168: 106668 (2024)- 2023
- [j29]Maurizio Bruglieri, M. Paolucci, Ornella Pisacane:
A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model. Comput. Oper. Res. 157: 106261 (2023) - [j28]Claudia Archetti, Maurizio Bruglieri, Gianfranco Guastaroba, M. Grazia Speranza:
The benefit of complete trip information in free-floating carsharing systems. EURO J. Transp. Logist. 12: 100110 (2023) - [j27]Maurizio Bruglieri, Ornella Pisacane:
A survey on emergent trends in the optimization of car-sharing systems. Int. Trans. Oper. Res. 30(6): 2867-2908 (2023) - 2022
- [j26]Maurizio Bruglieri, Daniele Ferone, Paola Festa, Ornella Pisacane:
A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations. Comput. Oper. Res. 143: 105770 (2022) - [j25]Maurizio Bruglieri, Roberto Cordone, Leo Liberti:
Maximum feasible subsystems of distance geometry constraints. J. Glob. Optim. 83(1): 29-47 (2022) - 2021
- [j24]Maurizio Bruglieri, Simona Mancini, Roberto Peruzzini, Ornella Pisacane:
The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates. Comput. Oper. Res. 125: 105102 (2021) - [j23]Maurizio Bruglieri, Roberto Cordone:
Metaheuristics for the Minimum Gap Graph Partitioning Problem. Comput. Oper. Res. 132: 105301 (2021) - [j22]Maurizio Bruglieri, Roberto Cordone, Isabella Lari, Federica Ricca, Andrea Scozzari:
On finding connected balanced partitions of trees. Discret. Appl. Math. 299: 1-16 (2021) - [j21]Maurizio Bruglieri, Simona Mancini, Ornella Pisacane:
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations. Optim. Lett. 15(8): 2813-2829 (2021) - 2020
- [j20]Maurizio Bruglieri:
The parking warden tour problem. Networks 76(4): 539-554 (2020)
2010 – 2019
- 2019
- [j19]Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane:
A path-based solution approach for the Green Vehicle Routing Problem. Comput. Oper. Res. 103: 109-122 (2019) - [j18]Maurizio Bruglieri, Simona Mancini, Ornella Pisacane:
The green vehicle routing problem with capacitated alternative fuel stations. Comput. Oper. Res. 112 (2019) - [j17]Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services. Discret. Appl. Math. 253: 185-200 (2019) - 2018
- [j16]Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems. J. Comb. Optim. 36(1): 162-193 (2018) - [j15]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
- [j14]Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems. Discret. Optim. 23: 56-80 (2017) - [j13]Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane, Stefano Suraci:
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges. Electron. Notes Discret. Math. 58: 95-102 (2017) - [j12]Mauro Maria Baldi, Maurizio Bruglieri:
On the generalized bin packing problem. Int. Trans. Oper. Res. 24(3): 425-438 (2017) - 2016
- [j11]Maurizio Bruglieri, Roberto Cordone:
Partitioning a graph into minimum gap components. Electron. Notes Discret. Math. 55: 33-36 (2016) - [j10]Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane:
A new Mathematical Programming Model for the Green Vehicle Routing Problem. Electron. Notes Discret. Math. 55: 89-92 (2016) - [c7]Maurizio Bruglieri, Cesare Cardani, Matteo Putzu:
Optimizing the Location of Helicopter Emergency Medical Service Operating Sites. MOD 2016: 293-305 - 2015
- [j9]Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane, Stefano Suraci:
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows. Electron. Notes Discret. Math. 47: 221-228 (2015) - [j8]Maurizio Bruglieri, Eliane Gerzelj, Andrea Guenzani, Roberto Maja, Rodrigo de Alvarenga Rosa:
Solving the 3-D Yard Allocation Problem for Break Bulk Cargo via Variable Neighborhood Search Branching. Electron. Notes Discret. Math. 47: 237-244 (2015) - 2014
- [j7]Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato:
The Gateway Location Problem: Assessing the impact of candidate site selection policies. Discret. Appl. Math. 165: 96-111 (2014) - [j6]Maurizio Bruglieri, Alberto Colorni, Alessandro Lué:
The relocation problem for the one-way electric vehicle sharing. Networks 64(4): 292-305 (2014) - 2013
- [i1]Maurizio Bruglieri, Alberto Colorni, Alessandro Lué:
The vehicle relocation problem for the one-way electric vehicle sharing. CoRR abs/1307.7195 (2013) - 2012
- [c6]Maurizio Bruglieri, Alberto Colorni, Tatjana Davidovic, Sanja Roksandic:
A Matheuristic Approach for the University Carpooling Problem. CTW 2012: 46-50 - 2011
- [c5]Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato:
The gateway location problem for hazardous material transportation. CTW 2011: 88-92 - [c4]Maurizio Bruglieri, Paola Cappanera, Alberto Colorni, Maddalena Nonato:
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting. INOC 2011: 262-276 - [c3]Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz:
On the Hazmat Transport Network Design Problem. INOC 2011: 327-338
2000 – 2009
- 2009
- [c2]Maurizio Bruglieri, Alberto Colorni, Alessandro Lué:
The Parking Warden Tour Problem. CTW 2009: 11-15 - [r1]Maurizio Bruglieri, Pierluigi Maponi, Maria Cristina Recchioni, Francesco Zirilli:
Differential Equations and Global Optimization. Encyclopedia of Optimization 2009: 702-710 - 2008
- [j5]Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale:
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. Comput. Oper. Res. 35(5): 1465-1482 (2008) - 2006
- [j4]Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli:
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9): 1344-1357 (2006) - [j3]Maurizio Bruglieri, Francesco Maffioli, Marco Trubian:
Solving minimum K-cardinality cut problems in planar graphs. Networks 48(4): 195-208 (2006) - 2004
- [j2]Maurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott:
Cardinality constrained minimum cut problems: complexity and algorithms. Discret. Appl. Math. 137(3): 311-341 (2004) - [j1]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) - [c1]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
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-08-03 20:14 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:
