Dynamic programming in the problem of optimization of a covering

MaRDI QIDQ1914130zbMATH OpenFDO

Authors Yanyan Li

Publication date 6 June 1996

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

allocating assignments to operatorsredundancyseveral travelling salespersons

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• The dynamic programming method in the generalized traveling salesman problem
• A procedure for solution of the problem of optimal covering of a finite set
• Dynamic programming in the problem of decomposition optimization
• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method

Cited in

(7)

• Dynamic programming in the problem of decomposition optimization
• A procedure for solution of the problem of optimal covering of a finite set
• Dynamic programming method in bottleneck tasks distribution problem with equal agents
• scientific article; zbMATH DE number 519989 (Why is no real title available?)
• On a generalized sequential partially covering problem
• Job distribution algorithms
• Dynamic programming based algorithms for set multicover and multiset multicover problems

This page was built for publication: Dynamic programming in the problem of optimization of a covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914130)