http://arxiv.org/abs/1710.09417
In this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of such assignment is maximum. I prove that the problem is NP-Hard and show a way of modeling this problem as a maximum weighted stable set problem. A real application is solved in this way through integer programming.
D. Severin
Fri, 27 Oct 17
27/60
Comments: N/A