The SCEAS System
| |||||||

## Search the dblp DataBase
Moustapha Diaby:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Moustapha Diaby
**On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem.**[Citation Graph (0, 0)][DBLP] IMECS, 2006, pp:774-779 [Conf] - Aaron Luntala Nsakanda, Michel Turcotte, Moustapha Diaby
**Air Cargo Operations Evaluation and Analysis through Simulation.**[Citation Graph (0, 0)][DBLP] Winter Simulation Conference, 2004, pp:1790-0 [Conf] - Anteneh Ayanso, Moustapha Diaby, Suresh K. Nair
**Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:1, pp:135-152 [Journal] - Aaron Luntala Nsakanda, Moustapha Diaby, Wilson L. Price
**Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:3, pp:1051-1070 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:634-638 [Journal] - Moustapha Diaby
**A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Moustapha Diaby
**On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Moustapha Diaby
**Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Moustapha Diaby
**The traveling salesman problem: A Linear programming formulation of**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **A Predictive Model of Redemption and Liability in Loyalty Reward Programs Industry.**[Citation Graph (, )][DBLP]**A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem**[Citation Graph (, )][DBLP]**Linear Programming Formulation of the Boolean Satisfiability Problem**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.021secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |