On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables
Computational Complexity
2016-10-21 v2 Discrete Mathematics
Data Structures and Algorithms
Optimization and Control
Abstract
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 of the existence of a one-to-one linear map between solutions of such models. *: Fiorini, S., S. Massar, S. Pokutta, H.R. Tiwary, and R. de Wolf (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Journal of the ACM 62:2, Article No. 17.
Keywords
Cite
@article{arxiv.1605.03243,
title = {On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables},
author = {Moustapha Diaby and Mark H. Karwan and Lei Sun},
journal= {arXiv preprint arXiv:1605.03243},
year = {2016}
}
Comments
7 pages; Minor typos fixed; Presentation of counter-example simplified