Moustapha Diaby

33 papers Misc 1Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2023 J jnl
On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers".
CoRR
Moustapha Diaby, Mark H. Karwan, Lei Sun
2021 J jnl
A Memetic Algorithm for an External Depot Production Routing Problem.
Algorithms
Bi Kouaï Bertin Kayé, Moustapha Diaby, Moussa Koivogui, Souleymane Oumtanaga
2019 J jnl
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims.
CoRR
Moustapha Diaby, Mark H. Karwan, Lei Sun
2018 J jnl
The indefinite period traveling salesman problem.
Eur. J. Oper. Res.
Lei Sun, Mark H. Karwan, Moustapha Diaby
2017 J jnl
Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems.
Int. J. Math. Oper. Res.
Moustapha Diaby, Mark H. Karwan
2016 J jnl
A Small-Order-Polynomial-Sized Linear Program for Solving the Traveling Salesman Problem.
CoRR
Moustapha Diaby, Mark H. Karwan, Lei Sun
2016 — book
Advances in Combinatorial Optimization - Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems
Advances in Combinatorial Optimization
Moustapha Diaby, Mark H. Karwan
2016 J jnl
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
Moustapha Diaby, Mark H. Karwan, Lei Sun
2015 J jnl
Planning the supply of rewards with cooperative promotion considerations in coalition loyalty programmes management.
J. Oper. Res. Soc.
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby
2014 J jnl
Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary.
CoRR
Moustapha Diaby, Mark H. Karwan
2013 — —
Approche de Gestion du Revenu pour un Problème de Tarification pour le Transport Longue Distance de Marchandises. (Bi-objective and Bilevel Approach for a Long Haul Freight Transportation Pricing Problem).
Moustapha Diaby
2013 J jnl
On Limits to the Scope of the Extended Formulations "Barriers".
CoRR
Moustapha Diaby, Mark H. Karwan
2013 J jnl
Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction.
Eur. J. Oper. Res.
Moustapha Diaby, Jose M. Cruz, Aaron Luntala Nsakanda
2012 J jnl
A stochastic linear programming modelling and solution approach for planning the supply of rewards in Loyalty Reward Programs.
Int. J. Math. Oper. Res.
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby
2012 — conf
Exploring Contracts with Options in Loyalty Reward Programs Supply Chain.
HICSS
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby, Shaobo Ji, Michael J. Hine
2011 J jnl
An aggregate inventory-based model for predicting redemption and liability in loyalty reward programs industry.
Inf. Syst. Frontiers
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
2011 J jnl
Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach.
Int. Trans. Oper. Res.
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
2010 — conf
A Predictive Model of Redemption and Liability in Loyalty Reward Programs Industry.
HICSS
Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao
2010 J jnl
Linear programming formulation of the vertex colouring problem.
Int. J. Math. Oper. Res.
Moustapha Diaby
2007 J jnl
A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
CoRR
Moustapha Diaby
2007 J jnl
Ensuring population diversity in genetic algorithms: A technical note with application to the cell formation problem.
Eur. J. Oper. Res.
Aaron Luntala Nsakanda, Wilson L. Price, Moustapha Diaby, Marc Gravel
2006 J jnl
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
CoRR
Moustapha Diaby
2006 J jnl
Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings.
Eur. J. Oper. Res.
Aaron Luntala Nsakanda, Moustapha Diaby, Wilson L. Price
2006 J jnl
Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis.
Eur. J. Oper. Res.
Anteneh Ayanso, Moustapha Diaby, Suresh K. Nair
2006 J jnl
Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs.
J. Oper. Res. Soc.
Moustapha Diaby, Aaron Luntala Nsakanda
2006 J jnl
On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
CoRR
Moustapha Diaby
2006 — conf
On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem.
IMECS
Moustapha Diaby
2006 J jnl
The traveling salesman problem: A Linear programming formulation of
CoRR
Moustapha Diaby
2004 Misc conf
Air Cargo Operations Evaluation and Analysis through Simulation.
WSC
Aaron Luntala Nsakanda, Michel Turcotte, Moustapha Diaby
2002 J jnl
Development and evaluation of an assignment heuristic for allocating cross-trained workers.
Eur. J. Oper. Res.
Gerard M. Campbell, Moustapha Diaby
1995 J jnl
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach.
INFORMS J. Comput.
Moustapha Diaby, R. Ramesh
1993 J jnl
Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts.
Oper. Res.
Moustapha Diaby, Alain Martel
1993 J jnl
Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem.
Oper. Res.
Moustapha Diaby