Combinatorial bounds on nonnegative rank and extended formulations
Authors:
- Samuel FioriniSFSamuel Fiorini
- Volker KaibelVKVolker Kaibel
- Kanstantsin PashkovichKPKanstantsin Pashkovich
- Dirk Oliver TheisDTDirk Oliver Theis
- 1 January 2013
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (1) , 67-83
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Extended Formulations for PolygonsDiscrete & Computational Geometry, 2012
- Extended formulations in combinatorial optimization4OR, 2010
- Computational aspects of the 2-dimension of partially ordered setsTheoretical Computer Science, 2004
- A comparison of two lower-bound methods for communication complexityTheoretical Computer Science, 1996
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- Using separation algorithms to generate mixed integer model reformulationsOperations Research Letters, 1991
- Factorization of nonnegative matrices—IILinear Algebra and its Applications, 1978
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965