Naval air defense planning problem: a novel formulation and heuristics

DOI10.1002/nav.22186MaRDI QIDQ6633264

ömer Kirca, Orhan Karasakal, Caner Arslan

Publication date: 5 November 2024

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

zbMATH Keywords

weapon target assignmentmissile schedulingnaval air defense

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms
• Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
• OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
• The weapon-target assignment problem
• Approximate dynamic programming for missile defense interceptor fire control
• Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
• Bi-objective dynamic weapon-target assignment problem with stability measure
• An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
• Air defense missile-target allocation models for a naval task group
• Weapon-target assignment problem: exact and approximate solution algorithms
• On a routing problem
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• Bi‐objective missile rescheduling for a naval task group with dynamic disruptions
• A Target-Assignment Problem
• A branch-and-price algorithm for a targeting problem

This page was built for publication: Naval air defense planning problem: a novel formulation and heuristics