Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
From MaRDI portal
Publication:3731616
DOI10.1287/moor.11.1.169zbMath0598.05024MaRDI QIDQ3731616
Publication date: 1986
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/2082
simplex; set covering; cube; Brouwer's fixed-point theorem; combinatorial lemma; simplotope; V-complex
65H10: Numerical computation of solutions to systems of equations
05B35: Combinatorial aspects of matroids and geometric lattices
05B40: Combinatorial aspects of packing and covering
Related Items
Closed covers of compact convex polyhedra, Some computational methods for systems of nonlinear equations and systems of polynomial equations, Intersection theorems with a continuum of intersection points