Locating names on vertices of a transaction network

David Alcaide-López-de-Pablo, Joaquín Sicilia and Miguel Á. González-Sierra

European Journal of Operational Research, 2017, vol. 262, issue 2, 464-478

Abstract: This paper deals with the problem of identifying names of unknown subjects located on vertices of a network which is previously established among subjects. The only available information is the knowledge of the names of some subjects in the network, and certain records of previous observations of transactions between all pairs of subjects. Such records offer us information about the frequency or intensity of these transactions. The aim is to find the more suitable identification of the unknown subjects taking into account the information about the frequency of transactions among subjects. It is proved that the problem is NP-hard. A heuristic approach is proposed for solving it and its performance is numerically illustrated.

Keywords: Assignment; Graph theory; Integer programming; Heuristic algorithms (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717303442
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:262:y:2017:i:2:p:464-478

DOI: 10.1016/j.ejor.2017.04.011

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().