New Heuristic Rounding Approaches to the Quadratic Assignment Problem

Details New Heuristic Rounding Approaches to the Quadratic Assignment Problem New Heuristic Rounding Approaches to the Quadratic Assignment Problem

2011-05-10

arxiv.org/abs/1105.1999v1

Apr. 2010, Volume 7, No.4 (Serial No.65), Journal of Communication and Computer, ISSN 1548-7709, USA

Computer Science

Computational Complexity

4 Pages

Scientific paper

Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.

Affiliated with

Also associated with

No associations

Rating

New Heuristic Rounding Approaches to the Quadratic 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 New Heuristic Rounding Approaches to the Quadratic Assignment Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Heuristic Rounding Approaches to the Quadratic Assignment Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-280626