Moustapha Diaby

ORCID

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 7

Top Venues

CoRR

Eur. J. Oper. Res.

Int. J. Math. Oper. Res.

J. Oper. Res. Soc.

Lille University of Science and Technology, France (PHD)

Education History

Lille University of Science and Technology, France

PHD

Publications

Moustapha Diaby, Mark H. Karwan, Lei Sun
On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers". CoRR (2023)
Bi Kouaï Bertin Kayé, Moustapha Diaby, Moussa Koivogui, Souleymane Oumtanaga
A Memetic Algorithm for an External Depot Production Routing Problem. Algorithms 14 (1) (2021)
Moustapha Diaby, Mark H. Karwan, Lei Sun
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims. CoRR (2019)
Lei Sun, Mark H. Karwan, Moustapha Diaby
The indefinite period traveling salesman problem. Eur. J. Oper. Res. 270 (3) (2018)
Moustapha Diaby, Mark H. Karwan
Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems. Int. J. Math. Oper. Res. 10 (1) (2017)
Moustapha Diaby, Mark H. Karwan, Lei Sun
On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables. CoRR (2016)
Moustapha Diaby, Mark H. Karwan, Lei Sun
A Small-Order-Polynomial-Sized Linear Program for Solving the Traveling Salesman Problem. CoRR (2016)
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby
Planning the supply of rewards with cooperative promotion considerations in coalition loyalty programmes management. J. Oper. Res. Soc. 66 (7) (2015)
Moustapha Diaby, Mark H. Karwan
Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary. CoRR (2014)
Moustapha Diaby, Jose M. Cruz, Aaron Luntala Nsakanda
Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction. Eur. J. Oper. Res. 228 (3) (2013)
Moustapha Diaby, Mark H. Karwan
On Limits to the Scope of the Extended Formulations "Barriers". CoRR (2013)
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby
A stochastic linear programming modelling and solution approach for planning the supply of rewards in Loyalty Reward Programs. Int. J. Math. Oper. Res. 4 (4) (2012)
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby, Shaobo Ji, Michael J. Hine
Exploring Contracts with Options in Loyalty Reward Programs Supply Chain. HICSS (2012)
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach. Int. Trans. Oper. Res. 18 (1) (2011)
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
An aggregate inventory-based model for predicting redemption and liability in loyalty reward programs industry. Inf. Syst. Frontiers 13 (5) (2011)
Moustapha Diaby
Linear programming formulation of the vertex colouring problem. Int. J. Math. Oper. Res. 2 (3) (2010)
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
A Predictive Model of Redemption and Liability in Loyalty Reward Programs Industry. HICSS (2010)
Moustapha Diaby
A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time" CoRR (2007)
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. Eur. J. Oper. Res. 178 (2) (2007)
Moustapha Diaby
On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem. IMECS (2006)
Moustapha Diaby
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem CoRR (2006)
Aaron Luntala Nsakanda, Moustapha Diaby, Wilson L. Price
Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings. Eur. J. Oper. Res. 171 (3) (2006)
Moustapha Diaby
The traveling salesman problem: A Linear programming formulation of CoRR (2006)
Moustapha Diaby
On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example" CoRR (2006)
Anteneh Ayanso, Moustapha Diaby, Suresh K. Nair
Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis. Eur. J. Oper. Res. 171 (1) (2006)
Moustapha Diaby, Aaron Luntala Nsakanda
Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs. J. Oper. Res. Soc. 57 (9) (2006)
Aaron Luntala Nsakanda, Michel Turcotte, Moustapha Diaby
Air Cargo Operations Evaluation and Analysis through Simulation. WSC (2004)
Gerard M. Campbell, Moustapha Diaby
Development and evaluation of an assignment heuristic for allocating cross-trained workers. Eur. J. Oper. Res. 138 (1) (2002)
Moustapha Diaby, R. Ramesh
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach. INFORMS J. Comput. 7 (1) (1995)
Moustapha Diaby, Alain Martel
Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts. Oper. Res. 41 (1) (1993)
Moustapha Diaby
Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem. Oper. Res. 41 (6) (1993)

Moustapha Diaby.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Moustapha Diaby