๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Targeting and scheduling problem for field artillery

โœ Scribed by Ojeong Kwon; Kyungsik Lee; Sungsoo Park


Book ID
104328959
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
355 KB
Volume
33
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis


We consider the targeting and the fire sequencing problem for field artillery. We show that the targeting problem, which can be modeled as a problem with nonlinear constraints, can be transformed into a set of independent bounded variable knapsack problems. We also propose a mathematical model for the fire sequencing problem which is NP-hard and developed a heuristic to solve the problem. Computational results using randomly generated data are presented.


๐Ÿ“œ SIMILAR VOLUMES


A branch-and-price algorithm for a targe
โœ Ojeong Kwon; Kyungsik Lee; Donghan Kang; Sungsoo Park ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 128 KB ๐Ÿ‘ 1 views