Theoretical complexity of grid cover problems used in radar applications

DOI10.1007/S10957-018-1354-XMaRDI QIDQ1626552zbMATH OpenOpenAlexWikidataFDO

Authors Yann Briheche, Fouad Bennis, Damien Chablat, Frédéric Barbaresco

Publication date 27 November 2018

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-018-1354-x

zbMATH Keywords

combinatorial optimizationgrid coveringNP-hardnessradar resource managementset cover problem

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Branch-and-bound method for just-in-time optimization of radar search patterns
• Solving radar netting problem with mathematical programming
• Optimization of transmitter-receiver pairing of spaceborne cluster flight netted radar for area coverage and target detection
• Mission planning for regional surveillance
• On the computational complexity of the patrol boat scheduling problem with complete coverage

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A PTAS for the Weighted Unit Disk Cover Problem
• Basis reduction and the complexity of branch-and-bound
• Completeness in approximation classes beyond APX
• Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
• Exact algorithms and APX-hardness results for geometric packing and covering problems
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3495588 (Why is no real title available?)
• scientific article; zbMATH DE number 1263202 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• On Finding Primal- and Dual-Optimal Bases
• On the hardness of approximating minimization problems
• Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network
• Quantum algorithms
• Reducibility among combinatorial problems
• The design of approximation algorithms

Cited in

(3)

• Judgement theorems and an approach for solving the constellation-to-ground coverage problem
• Branch-and-bound method for just-in-time optimization of radar search patterns
• Solving radar netting problem with mathematical programming

This page was built for publication: Theoretical complexity of grid cover problems used in radar applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626552)