A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem

Computational Optimization and Applications

Volumn 19, Issue 2, 2001, Pages 145-164

  Robertson, Alexander J ^a  

^a NORTHROP GRUMMAN CORPORATION   (United States)

Author keywords

Assignment problem; Discrete optimization; GRASP; NP complete

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA REDUCTION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; RANDOM PROCESSES;

DATA ASSOCIATION; GREEDY RANDOMIZED ADAPTIVE LOCAL SEARCH PROCEDURE (GRASP);

COMPUTATIONAL COMPLEXITY;

EID: 0035399109     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011285402433     Document Type: Article

References (41)

1. An algorithm for the three-index assignment problem
2. Approximation algorithms for multi-dimensional assignment problems with decomposable costs
3. Approximation algorithms for three-dimensional assignment problems with triangle inequalities
4. A S-dimensional assignment algorithm for track initiation
5. A multisensor-multitarget data association algorithm for hetereogeneous sensors
6. A new algorithm for the generalized multidimensional assignment problem
7. Flight scheduling and maintenance base planning
8. A greedy randomized adaptive search procedure for maximum independent set
9. An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice
10. A primal-dual algorithm for the three-dimensional assignment problem
11. A greedy randomized adaptive search procedure for the quadratic assignment problem
12. An effective heuristic algorithm for the traveling salesman problem
13. Application of 0-1 Integer programming to multitarget tracking problems
14. A GRASP for the multi-target multi-sensor tracking problem
15. A parallel GRASP for the data association multidimensional assignment problem
16. Passive multisensor data association using a new relaxation algorithm
17. Improved combinatorial programming algorithms for a class of all-zero-one integer programming problems
18. The tri-substitution method for the three-dimensional assignment problem
19. The multidimensional assignment problem
20. Multidimensional assignment formulation of data association problems arising from multitarget tracking and multisensor data fusion
21. Multidimensional assignments and multitarget tracking
22. A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking
23. A numerical study of some data association problems arising in multitarget tracking
24. Partitioning multiple data sets: Multidimensional assignments and Lagrangian relaxation
25. A new multidimensional data association algorithm for multisensor-multitarget tracking
26. A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
27. A new class of Lagrangian relaxation based algorithms for fast data association in multiple hypothesis tracking applications
28. An algorithm for tracking multiple targets
29. Neural network optimization for multi-target multi-sensor passive tracking
30. An optimal data association problem in surveillance theory
31. Generalized correlation of multi-target data