A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target

DOI10.1007/978-3-319-18161-5_10zbMath1370.90126MaRDI QIDQ5356975

Duc Manh Nguyen, Hoai An Le Thi, Tao Pham Dinh

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_10

zbMATH Keywords

combinatorial optimization; search theory; hierarchical optimization; exact penalty; DC programming and DCA; nonlinear mixed 0-1 programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90B40: Search theory

90C27: Combinatorial optimization

Related Items

Planning a multi-sensors search for a moving target considering traveling costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DC programming approach for planning a multisensor multizone search for a target
• A hierarchical approach for planning a multisensor multizone search for a moving target
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A tutorial on the cross-entropy method
• Search for a Moving Target: The FAB Algorithm
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Constrained Optimization of Functionals with Search Theory Applications