2 papers
cs.CC2019
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims
Moustapha Diaby, Mark H. Karwan, Lei Sun
There has been a series of developments in the recent literature (by essentially a same "circle" of authors) with the absolute/unconditioned (implicit or explicit) claim that there…
cs.CC2016
On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables
Moustapha Diaby, Mark H. Karwan, Lei Sun
We provide a numerical refutation of the developments of Fiorini et al. (2015)* for models with disjoint sets of descriptive variables. We also provide an insight into the meaning…