Francesco Mason

Personal Details

First Name:	Francesco
Middle Name:
Last Name:	Mason
Suffix:
RePEc Short-ID:	pma975
	[This author has chosen not to make the email address public]

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

Sorry, no citations of working papers recorded.

Articles

1. Marisa Cenci & Mirko Giacomo & Francesco Mason, 2017. "A note on a mixed routing and scheduling problem on a grid graph," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1363-1376, November.

   Cited by:

   1. Mirko Giacomo & Francesco Mason & Marisa Cenci, 2020. "A note on solving the Fleet Quickest Routing Problem on a grid graph," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1069-1090, September.

2. Bassetto, Tatiana & Mason, Francesco, 2011. "Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs," European Journal of Operational Research, Elsevier, vol. 208(3), pages 253-262, February.

   Cited by:

   1. Kinable, Joris & Smeulders, Bart & Delcour, Eline & Spieksma, Frits C.R., 2017. "Exact algorithms for the Equitable Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 261(2), pages 475-485.
   2. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.

3. Andreatta, G. & Mason, F., 1985. "k-eccentricity and absolute k-centrum of a probabilistic tree," European Journal of Operational Research, Elsevier, vol. 19(1), pages 114-117, January.

   Cited by:

   1. Rodríguez-Chía, Antonio M. & Espejo, Inmaculada & Drezner, Zvi, 2010. "On solving the planar k-centrum problem with Euclidean distances," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1169-1186, December.
   2. Duin, C. W. & Volgenant, A., 1997. "The partial sum criterion for Steiner trees in graphs and shortest paths," European Journal of Operational Research, Elsevier, vol. 97(1), pages 172-182, February.
   3. H. Edwin Romeijn & Ravindra K. Ahuja & James F. Dempsey & Arvind Kumar, 2006. "A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems," Operations Research, INFORMS, vol. 54(2), pages 201-216, April.
   4. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 2 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.

1. NEP-CMP: Computational Economics (2) 2007-10-27 2011-11-01

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Francesco Mason should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.