28 citations · 29 across the 13 of their papers we have counts for
Showing 2006 · cs.CCShow all
3 papers · 2 filters
cs.CC2006
On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
Moustapha Diaby
We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.
cs.CC2006★ 28 cited
The traveling salesman problem: A Linear programming formulation
Moustapha Diaby
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Nume…
cs.CC2006★ 1 cited
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
Moustapha Diaby
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. He…