𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm for sector allocation of a naval task group

✍ Scribed by Orhan Karasakal; Levent Kandiller; Nur Evin Özdemirel

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
406 KB
Volume
58
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Anti-ship missile defense for a naval ta
Anti-ship missile defense for a naval task group
✍ Orhan Karasakal; Nur Evin Özdemirel; Levent Kandiller 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

## Abstract In this study, we present a new formulation for the air defense problem of warships in a naval task group and propose a solution method. We define the missile allocation problem (MAP) as the optimal allocation of a set of surface‐to‐air missiles (SAMs) of a naval task group to a set of

A branch-and-bound algorithm for flow-pa
A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
✍ M. A. Venkataramanan; Kathryn A. Wilson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that th

The critical-item, upper bounds, and a b
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
✍ Shaw, Dong X.; Cho, Geon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac