Empirical evaluation of construction heuristics for the multidimensional assignment problem

Details Empirical evaluation of construction heuristics for the multidimensional assignment problem Empirical evaluation of construction heuristics for the multidimensional assignment problem

2009-06-16

arxiv.org/abs/0906.2960v1

Text in Algorithmics 11 (2009) 107-122

Computer Science

Data Structures and Algorithms

15 pages

Scientific paper

The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics is proposed to optimize the access to slow computer memory. The results of computational experiments for several instance families are provided and discussed.

Affiliated with

Also associated with

No associations

Rating

Empirical evaluation of construction heuristics for the multidimensional assignment problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Empirical evaluation of construction heuristics for the multidimensional assignment problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Empirical evaluation of construction heuristics for the multidimensional assignment problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475875