default search action
Moustapha Diaby
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i10]Moustapha Diaby, Mark H. Karwan, Lei Sun:
On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers". CoRR abs/2304.07716 (2023) - 2021
- [j17]Bi Kouaï Bertin Kayé
, Moustapha Diaby
A Memetic Algorithm for an External Depot Production Routing Problem. Algorithms 14(1): 27 (2021)
2010 – 2019
- 2019
- [i9]Moustapha Diaby, Mark H. Karwan, Lei Sun:
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims. CoRR abs/1902.03549 (2019) - 2018
- [j16]Lei Sun, Mark H. Karwan, Moustapha Diaby:
The indefinite period traveling salesman problem. Eur. J. Oper. Res. 270(3): 1171-1181 (2018) - 2017
- [j15]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): 18-33 (2017) - 2016
- [b2]Moustapha Diaby, Mark H. Karwan:
Advances in Combinatorial Optimization - Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems. WorldScientific 2016, ISBN 9789814704878, pp. 1-220 - [i8]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 abs/1605.03243 (2016) - [i7]Moustapha Diaby, Mark H. Karwan, Lei Sun:
A Small-Order-Polynomial-Sized Linear Program for Solving the Traveling Salesman Problem. CoRR abs/1610.00353 (2016) - 2015
- [j14]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): 1140-1154 (2015) - 2014
- [i6]Moustapha Diaby, Mark H. Karwan:
Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary. CoRR abs/1403.0529 (2014) - 2013
- [b1]Moustapha Diaby:
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). Lille University of Science and Technology, France, 2013 - [j13]Moustapha Diaby, Jose M. Cruz
Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction. Eur. J. Oper. Res. 228(3): 526-535 (2013) - [i5]Moustapha Diaby, Mark H. Karwan:
On Limits to the Scope of the Extended Formulations "Barriers". CoRR abs/1309.1823 (2013) - 2012
- [j12]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): 400-421 (2012) - [c4]Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby, Shaobo Ji
Exploring Contracts with Options in Loyalty Reward Programs Supply Chain. HICSS 2012: 1257-1266 - 2011
- [j11]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): 707-719 (2011) - [j10]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): 71-86 (2011) - 2010
- [j9]Moustapha Diaby:
Linear programming formulation of the vertex colouring problem. Int. J. Math. Oper. Res. 2(3): 259-289 (2010) - [c3]Aaron Luntala Nsakanda, Moustapha Diaby, Yuheng Cao:
A Predictive Model of Redemption and Liability in Loyalty Reward Programs Industry. HICSS 2010: 1-11
2000 – 2009
- 2007
- [j8]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): 634-638 (2007) - [i4]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) - 2006
- [j7]Anteneh Ayanso, Moustapha Diaby, Suresh K. Nair:
Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis. Eur. J. Oper. Res. 171(1): 135-152 (2006) - [j6]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): 1051-1070 (2006) - [j5]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): 1100-1112 (2006) - [c2]Moustapha Diaby:
On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem. IMECS 2006: 774-779 - [i3]Moustapha Diaby:
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem. CoRR abs/cs/0609004 (2006) - [i2]Moustapha Diaby:
The traveling salesman problem: A Linear programming formulation of. CoRR abs/cs/0609005 (2006) - [i1]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) - 2004
- [c1]Aaron Luntala Nsakanda, Michel Turcotte, Moustapha Diaby:
Air Cargo Operations Evaluation and Analysis through Simulation. WSC 2004: 1790-1798 - 2002
- [j4]Gerard M. Campbell
Development and evaluation of an assignment heuristic for allocating cross-trained workers. Eur. J. Oper. Res. 138(1): 9-20 (2002)
1990 – 1999
- 1995
- [j3]Moustapha Diaby, R. Ramesh:
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach. INFORMS J. Comput. 7(1): 24-35 (1995) - 1993
- [j2]Moustapha Diaby, Alain Martel:
Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts. Oper. Res. 41(1): 48-59 (1993) - [j1]Moustapha Diaby:
Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem. Oper. Res. 41(6): 1172-1176 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: