Abstract
We consider the general problem formulation as the minimization of the sum of the numbers of the feasible subset of cardinality n out of the set of N numbers. Asymmetric travelling salesman problem, assignement problem and the problem of minimization of the sum of n numbers out of the set of N numbers can be formulated in these terms. The input of all these problems can be represented as the point from the non-negative part of the unit sphere after some intuitive scaling. In this settings we assume that the retrieval of the input data is difficult. We further propose to skip the retrieval of some input numbers and substitute them with the zeros. We call this problem the problem with incomplete input. We estimate the quality of the optimal solution for the problem with incomplete input used as the solution for the problem with the complete data.
Similar content being viewed by others
References
Garey, M.R., Johnson, D.S.: Computers and Intractability. WH freeman, New York (2002)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation, North Chelmsford (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Barketau, M. Evaluation of solution of discrete optimization problem with incomplete input. Optim Lett 15, 431–440 (2021). https://doi.org/10.1007/s11590-020-01606-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01606-y