default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonica Gentili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Shahab Sadri
, Arsalan Paleshi, Lihui Bai, Monica Gentili:
A Simulation Study for a Safe Reopening and Operation of the Trager Institute Optimal Aging Clinic During the COVID-19 Pandemic. INFORMS J. Appl. Anal. 54(2): 188-204 (2024)- 2023
- [j32]Mohsen Mohammadi, Monica Gentili, Milan Hladík, Raffaele Cerulli:
Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides. J. Optim. Theory Appl. 199(3): 955-992 (2023) - 2022
- [j31]Monica Gentili, Pitu B. Mirchandani, Alessandro Agnetis, Zabih Ghelichi:
Locating platforms and scheduling a fleet of drones for emergency delivery of perishable items. Comput. Ind. Eng. 168: 108057 (2022) - [j30]Fernando Álvarez-Bazo, Raffaele Cerulli, Santos Sánchez-Cambronero, Monica Gentili, Ana Rivas:
An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation. Comput. Oper. Res. 138: 105596 (2022) - [j29]Sadaf Ahmed, Monica Gentili, Daniel Sierra-Sosa, Adel Said Elmaghraby:
Multi-layer data integration technique for combining heterogeneous crime data. Inf. Process. Manag. 59(3): 102879 (2022) - 2021
- [j28]Mohsen Mohammadi, Monica Gentili:
The outcome range problem in interval linear programming. Comput. Oper. Res. 129: 105160 (2021) - [j27]Zabih Ghelichi, Monica Gentili, Pitu B. Mirchandani:
Logistics for a fleet of drones for medical item delivery: A case study for Louisville, KY. Comput. Oper. Res. 135: 105443 (2021)
2010 – 2019
- 2019
- [j26]Mohsen Mohammadi, Monica Gentili:
Bounds on the worst optimal value in interval linear programming. Soft Comput. 23(21): 11055-11061 (2019) - 2018
- [j25]Francesco Carrabs, Raffaele Cerulli, Monica Gentili:
Preface: Theoretical and algorithmic contributions to network optimization problems. Networks 71(4): 325 (2018) - 2017
- [j24]Andrea Raiconi, Julia Pahl, Monica Gentili, Stefan Voß, Raffaele Cerulli:
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. Asia Pac. J. Oper. Res. 34(5): 1750019:1-1750019:24 (2017) - 2016
- [j23]Giuseppe Bruno, Raffaele Cerulli, Monica Gentili:
Models, algorithms and applications for location problems. Optim. Lett. 10(5): 871-873 (2016) - 2015
- [j22]Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Monica Gentili, Andrea Raiconi:
Maximizing lifetime in wireless sensor networks with multiple sensor families. Comput. Oper. Res. 60: 121-137 (2015) - [j21]Carmine Cerrone, Raffaele Cerulli, Monica Gentili:
Vehicle-ID sensor location for route flow recognition: Models and algorithms. Eur. J. Oper. Res. 247(2): 618-629 (2015) - 2014
- [j20]Lucio Bianco, Carmine Cerrone, Raffaele Cerulli, Monica Gentili:
Locating sensors to observe network arc flows: Exact and heuristic approaches. Comput. Oper. Res. 46: 12-22 (2014) - [j19]Raffaele Cerulli, Monica Gentili:
Editorial. Networks 64(4): 233 (2014) - [j18]Raffaele Cerulli, Monica Gentili, Andrea Raiconi:
Maximizing lifetime and handling reliability in wireless sensor networks. Networks 64(4): 321-338 (2014) - [j17]Monica Gentili, Pitu B. Mirchandani:
Computational complexity analysis of the sensor location flow observability problem. Optim. Lett. 8(8): 2245-2259 (2014) - 2013
- [j16]Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili:
Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56(2): 405-438 (2013) - [j15]John Silberholz, Andrea Raiconi, Raffaele Cerulli, Monica Gentili, Bruce L. Golden, S. Chen:
Comparison of heuristics for the colourful travelling salesman problem. Int. J. Metaheuristics 2(2): 141-173 (2013) - [j14]Monica Gentili, Andrea Raiconi:
α-Coverage to extend network lifetime on wireless sensor networks. Optim. Lett. 7(1): 157-172 (2013) - 2011
- [c3]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC 2011: 589-602 - [c2]Andrea Raiconi, Monica Gentili:
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks. INOC 2011: 607-619
2000 – 2009
- 2009
- [j13]Raffaele Cerulli, Monica Gentili, Antonio Iossa:
Bounded-degree spanning tree problems: models and new algorithms. Comput. Optim. Appl. 42(3): 353-370 (2009) - [j12]Francesco Carrabs, Raffaele Cerulli, Monica Gentili:
The labeled maximum matching problem. Comput. Oper. Res. 36(6): 1859-1871 (2009) - 2008
- [j11]Raffaele Cerulli, Monica Gentili, Antonio Iossa:
Efficient preflow push algorithms. Comput. Oper. Res. 35(8): 2694-2708 (2008) - 2007
- [j10]Massimiliano Caramia, Paolo Dell'Olmo, Monica Gentili, Pitu B. Mirchandani:
Delivery itineraries and distribution capacity of a freight network with time slots. Comput. Oper. Res. 34(6): 1585-1600 (2007) - 2006
- [j9]Lucio Bianco, Giuseppe Confessore, Monica Gentili:
Combinatorial aspects of the sensor location problem. Ann. Oper. Res. 144(1): 201-234 (2006) - [j8]Raffaele Cerulli, Paolo Dell'Olmo, Monica Gentili, Andrea Raiconi:
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. Electron. Notes Discret. Math. 25: 131-138 (2006) - [j7]Paolo Dell'Olmo, Monica Gentili:
Graph models for scheduling systems with machine saturation property. Math. Methods Oper. Res. 63(2): 329-340 (2006) - 2005
- [j6]Monica Gentili, Pitu B. Mirchandani:
Locating Active Sensors on Traffic Networks. Ann. Oper. Res. 136(1): 229-257 (2005) - [j5]Giuseppe Confessore, Paolo Dell'Olmo, Monica Gentili:
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Comput. Oper. Res. 32: 2383-2405 (2005) - [j4]Paolo Dell'Olmo, Monica Gentili, Andrea Scozzari:
On finding dissimilar Pareto-optimal paths. Eur. J. Oper. Res. 162(1): 70-82 (2005) - [j3]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett. 94(1): 29-35 (2005) - 2004
- [j2]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. Electron. Notes Discret. Math. 17: 87-91 (2004) - [c1]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. CTW 2004: 81-85 - 2003
- [j1]Monica Gentili:
Visiting a network of services with time constraints. Comput. Oper. Res. 30(8): 1187-1217 (2003)
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-07-05 21:03 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:
