Loading...
Please wait, while we are loading the content...
Targeting and Scheduling Problem for Field Artillery
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kwon, O. Lee, Kyungsik Park, Sungsoo |
| Copyright Year | 2003 |
| Abstract | 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. © 1997 Elsevier Science Ltd |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://solab.kaist.ac.kr/files/papers/intl_conf/1996_1.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Computation Heuristic Knapsack problem Mathematical model Mathematics NP-hardness Nonlinear system Procedural generation Scheduling (computing) Scheduling - HL7 Publishing Domain cellular targeting |
| Content Type | Text |
| Resource Type | Article |
