Moustapha Diaby

Orcid: 0000-0002-6457-7584

According to our database1, Moustapha Diaby authored at least 31 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers".
CoRR, 2023

2021
A Memetic Algorithm for an External Depot Production Routing Problem.
Algorithms, 2021

2019
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims.
CoRR, 2019

2018
The indefinite period traveling salesman problem.
Eur. J. Oper. Res., 2018

2017
Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems.
Int. J. Math. Oper. Res., 2017

2016
A Small-Order-Polynomial-Sized Linear Program for Solving the Traveling Salesman Problem.
CoRR, 2016

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

2015
Planning the supply of rewards with cooperative promotion considerations in coalition loyalty programmes management.
J. Oper. Res. Soc., 2015

2014
Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary.
CoRR, 2014

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).
PhD thesis, 2013

Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction.
Eur. J. Oper. Res., 2013

On Limits to the Scope of the Extended Formulations "Barriers".
CoRR, 2013

2012
A stochastic linear programming modelling and solution approach for planning the supply of rewards in Loyalty Reward Programs.
Int. J. Math. Oper. Res., 2012

Exploring Contracts with Options in Loyalty Reward Programs Supply Chain.
Proceedings of the 45th Hawaii International International Conference on Systems Science (HICSS-45 2012), 2012

2011
Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach.
Int. Trans. Oper. Res., 2011

An aggregate inventory-based model for predicting redemption and liability in loyalty reward programs industry.
Inf. Syst. Frontiers, 2011

2010
Linear programming formulation of the vertex colouring problem.
Int. J. Math. Oper. Res., 2010

A Predictive Model of Redemption and Liability in Loyalty Reward Programs Industry.
Proceedings of the 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), 2010

2007
Ensuring population diversity in genetic algorithms: A technical note with application to the cell formation problem.
Eur. J. Oper. Res., 2007

A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
CoRR, 2007

2006
Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs.
J. Oper. Res. Soc., 2006

Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings.
Eur. J. Oper. Res., 2006

Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis.
Eur. J. Oper. Res., 2006

On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
CoRR, 2006

The traveling salesman problem: A Linear programming formulation of
CoRR, 2006

On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, 2006

2004
Air Cargo Operations Evaluation and Analysis through Simulation.
Proceedings of the 36th conference on Winter simulation, 2004

2002
Development and evaluation of an assignment heuristic for allocating cross-trained workers.
Eur. J. Oper. Res., 2002

1995
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach.
INFORMS J. Comput., 1995

1993
Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts.
Oper. Res., 1993

Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem.
Oper. Res., 1993


  Loading...