| * | 2008 |
| 12 | EE | Moustapha Diaby:
A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem
CoRR abs/0803.4354: (2008) |
| 11 | EE | Moustapha Diaby:
Linear Programming Formulation of the Boolean Satisfiability Problem
CoRR abs/0808.3386: (2008) |
| 2007 |
| 10 | EE | Moustapha Diaby:
A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
CoRR abs/cs/0701014: (2007) |
| 9 | EE | Aaron Luntala Nsakanda,
Wilson L. Price,
Moustapha Diaby,
Marc Gravel:
Ensuring population diversity in genetic algorithms: A technical note with application to the cell formation problem.
European Journal of Operational Research 178(2): 634-638 (2007) |
| 2006 |
| 8 | | Moustapha Diaby:
On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem.
IMECS 2006: 774-779 |
| 7 | EE | Moustapha Diaby:
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
CoRR abs/cs/0609004: (2006) |
| 6 | EE | Moustapha Diaby:
The traveling salesman problem: A Linear programming formulation of
CoRR abs/cs/0609005: (2006) |
| 5 | EE | Moustapha Diaby:
On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
CoRR abs/cs/0611074: (2006) |
| 4 | EE | Anteneh Ayanso,
Moustapha Diaby,
Suresh K. Nair:
Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis.
European Journal of Operational Research 171(1): 135-152 (2006) |
| 3 | EE | Aaron Luntala Nsakanda,
Moustapha Diaby,
Wilson L. Price:
Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings.
European Journal of Operational Research 171(3): 1051-1070 (2006) |
| 2004 |
| 2 | EE | Aaron Luntala Nsakanda,
Michel Turcotte,
Moustapha Diaby:
Air Cargo Operations Evaluation and Analysis through Simulation.
Winter Simulation Conference 2004: 1790- |
| 1995 |
| 1 | EE | Moustapha Diaby,
R. Ramesh:
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach.
INFORMS Journal on Computing 7(1): 24-35 (1995) |