IDEAS home Printed from https://ideas.repec.org/f/pma975.html
   My authors  Follow this author

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]

Research output

as
Jump to: Working papers Articles

Working papers

  1. Francesco Mason & Andrea Borghesan, 2014. "Circuits of Iterated Foata Maps," Working Papers 25, Department of Management, Università Ca' Foscari Venezia.
  2. Andrea Borghesan & Daniela Favaretto & Francesco Mason, 2012. "Constrained matchings in bipartite graphs," Working Papers 22, Department of Management, Università Ca' Foscari Venezia.
  3. Renato Bettin & Francesco Mason & Marco Corazza & Giovanni Fasano, 2011. "An Artificial Neural Network technique for on-line hotel booking," Working Papers 10, Department of Management, Università Ca' Foscari Venezia.
  4. Tatiana Bassetto & Francesco Mason, 2008. "A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs," Working Papers 173, Department of Applied Mathematics, Università Ca' Foscari Venezia.
  5. Tatiana Bassetto & Francesco Mason, 2007. "The 2-period balanced traveling salesman problem," Working Papers 154, Department of Applied Mathematics, Università Ca' Foscari Venezia, revised Oct 2007.

Articles

  1. 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.
  2. Mason, Francesco & Tomasin, Elena Moretti, 1993. "A model for the assignment of candidates to constituencies in a mixed election system," European Journal of Operational Research, Elsevier, vol. 70(2), pages 254-262, October.
  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.

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. 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. 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. 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.
    2. 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.

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 4 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.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.