Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem

Details Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem

2006-09-02

arxiv.org/abs/cs/0609004v9

Computer Science

Computational Complexity

6 pages; Published in the 2006 IMECS Conference Proceedings (ISBN: 988 98671-3-3); Hofman's claimed "counter-example" is inval

Scientific paper

In this paper, we present a polynomial-sized linear programming formulation
of the Quadratic Assignment Problem (QAP). The proposed linear program is a
network flow-based model. Hence, it provides for the solution of the QAP in
polynomial time. Computational testing and results are discussed.

Affiliated with

Also associated with

No associations

Rating

Equality of complexity classes P and NP: Linear programming formulation of 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 Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109602