Average case performance of heuristics for multi-dimensional assignment problems

Details Average case performance of heuristics for multi-dimensional assignment problems Average case performance of heuristics for multi-dimensional assignment problems

2010-04-23

arxiv.org/abs/1004.4239v1

Computer Science

Discrete Mathematics

Scientific paper

We consider multi-dimensional assignment problems in a probabilistic setting.
Our main results are: (i) A new efficient algorithm for the 3-dimensional
planar problem, based on enumerating and selecting from a set of
"alternating-path trees"; (ii) A new efficient matching-based algorithm for the
3-dimensional axial problem.

Affiliated with

Also associated with

No associations

Rating

Average case performance of heuristics for multi-dimensional assignment problems 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 Average case performance of heuristics for multi-dimensional assignment problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average case performance of heuristics for multi-dimensional assignment problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386963