A procedure for solution of the problem of optimal covering of a finite set

DOI10.1007/BF02667911zbMath0946.90036OpenAlexW2025592121MaRDI QIDQ1968506

L. G. Sabiryanova

Publication date: 25 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02667911

zbMATH Keywords

combinatorial optimizationtraveling salesman problemassignment problemcovering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. II: Exact methods
• Dynamic programming in the problem of optimization of a covering

This page was built for publication: A procedure for solution of the problem of optimal covering of a finite set