Theoretical complexity of grid cover problems used in radar applications

DOI10.1007/S10957-018-1354-XzbMATH Open1440.05058OpenAlexW2887531599WikidataQ129389426 ScholiaQ129389426MaRDI QIDQ1626552FDOQ1626552

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

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

zbMATH Keywords

combinatorial optimizationNP-hardnessset cover problemgrid coveringradar resource management

Mathematics Subject Classification ID

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

Cites Work

• The design of approximation algorithms
• Reducibility among combinatorial problems
• A Greedy Heuristic for the Set-Covering Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the hardness of approximating minimization problems
• Exact algorithms and APX-hardness results for geometric packing and covering problems
• Title not available (Why is that?)
• Completeness in approximation classes beyond APX
• A PTAS for the Weighted Unit Disk Cover Problem
• Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network
• On Finding Primal- and Dual-Optimal Bases
• Basis reduction and the complexity of branch-and-bound

Cited In (3)

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

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)