Monica Gentili

Orcid: 0000-0003-3895-0629

According to our database1, Monica Gentili authored at least 34 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides.
J. Optim. Theory Appl., December, 2023

2022
Multi-layer data integration technique for combining heterogeneous crime data.
Inf. Process. Manag., 2022

An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation.
Comput. Oper. Res., 2022

Locating platforms and scheduling a fleet of drones for emergency delivery of perishable items.
Comput. Ind. Eng., 2022

2021
The outcome range problem in interval linear programming.
Comput. Oper. Res., 2021

Logistics for a fleet of drones for medical item delivery: A case study for Louisville, KY.
Comput. Oper. Res., 2021

2019
Bounds on the worst optimal value in interval linear programming.
Soft Comput., 2019

2018
Preface: Theoretical and algorithmic contributions to network optimization problems.
Networks, 2018

2017
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations.
Asia Pac. J. Oper. Res., 2017

2016
Models, algorithms and applications for location problems.
Optim. Lett., 2016

2015
Vehicle-ID sensor location for route flow recognition: Models and algorithms.
Eur. J. Oper. Res., 2015

Maximizing lifetime in wireless sensor networks with multiple sensor families.
Comput. Oper. Res., 2015

2014
Computational complexity analysis of the sensor location flow observability problem.
Optim. Lett., 2014

Maximizing lifetime and handling reliability in wireless sensor networks.
Networks, 2014

Editorial.
Networks, 2014

Locating sensors to observe network arc flows: Exact and heuristic approaches.
Comput. Oper. Res., 2014

2013
α-Coverage to extend network lifetime on wireless sensor networks.
Optim. Lett., 2013

Comparison of heuristics for the colourful travelling salesman problem.
Int. J. Metaheuristics, 2013

Lower and upper bounds for the spanning tree with minimum branch vertices.
Comput. Optim. Appl., 2013

2011
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2009
The labeled maximum matching problem.
Comput. Oper. Res., 2009

Bounded-degree spanning tree problems: models and new algorithms.
Comput. Optim. Appl., 2009

2008
Efficient preflow push algorithms.
Comput. Oper. Res., 2008

2007
Delivery itineraries and distribution capacity of a freight network with time slots.
Comput. Oper. Res., 2007

2006
Graph models for scheduling systems with machine saturation property.
Math. Methods Oper. Res., 2006

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem.
Electron. Notes Discret. Math., 2006

Combinatorial aspects of the sensor location problem.
Ann. Oper. Res., 2006

2005
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds.
Inf. Process. Lett., 2005

On finding dissimilar Pareto-optimal paths.
Eur. J. Oper. Res., 2005

Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem.
Comput. Oper. Res., 2005

Locating Active Sensors on Traffic Networks.
Ann. Oper. Res., 2005

2004
Minimum Weighted Feedback Vertex Set on Diamonds.
Electron. Notes Discret. Math., 2004

2003
Visiting a network of services with time constraints.
Comput. Oper. Res., 2003


  Loading...