A DC programming approach for planning a multisensor multizone search for a target
From MaRDI portal
Publication:336797
DOI10.1016/j.cor.2012.07.006zbMath1348.90347OpenAlexW2046536138MaRDI QIDQ336797
Duc Manh Nguyen, Tao Pham Dinh, Hoai An Le Thi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.006
combinatorial optimizationsearch theoryhierarchical optimizationexact penaltyDC programming and DCAnonlinear mixed 0-1 programming
Related Items (5)
Trajectory optimization under kinematical constraints for moving target search ⋮ DC Programming and DCA for General DC Programs ⋮ A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target ⋮ DC programming and DCA: thirty years of developments ⋮ Planning a multi-sensors search for a moving target considering traveling costs
Cites Work
- Unnamed Item
- Unnamed Item
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- 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
- Convergence properties of the cross-entropy method for discrete optimization
- 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
- Search and Its Optimization
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
This page was built for publication: A DC programming approach for planning a multisensor multizone search for a target
