A branch-and-price algorithm for a targeting problem

DOI10.1002/nav.20247zbMath1137.90586OpenAlexW2136914017MaRDI QIDQ5386381

Kyungsik Lee, Sungsoo Park, Donghan Kang, Ojeong Kwon

Publication date: 14 May 2008

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20247

zbMATH Keywords

integer programmingbranch-and-pricetargeting problemweapon-target assignment

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (5)

Evolutionary decision-makings for the dynamic weapon-target assignment problem ⋮ Effect Oriented Planning of Joint Attacks ⋮ A hybrid discrete grey wolf optimizer to solve weapon target assignment problems ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ Approximate dynamic programming for missile defense interceptor fire control

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A branch-and-price algorithm for a targeting problem