scientific article; zbMATH DE number 5548206
From MaRDI portal
Publication:3622253
Recommendations
- On the generation of convex polyominoes
- scientific article; zbMATH DE number 1263258
- On the monotonization of polyhedra
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
- scientific article; zbMATH DE number 4108497
- Generating all vertices of a polyhedron is hard
- Generating all vertices of a polyhedron is hard
- On Inducing Polygons and Related Problems
- On inducing polygons and related problems
- On the exhaustive generation of \(k\)-convex polyominoes
Cited in
(17)- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- Estimating the number of vertices of a polyhedron
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- The Complexity of Vertex Enumeration Methods
- Generating all vertices of a polyhedron is hard
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- An iterative vertex enumeration method for objective space based vector optimization algorithms
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Forbidden vertices
- Computational Science and Its Applications – ICCSA 2004
- Generating all vertices of a polyhedron is hard
- Minimal balanced collections and their application to core stability and other topics of game theory
- On the readability of monotone Boolean formulae
- Traversing combinatorial 0/1-polytopes via optimization
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- From amortized to worst case delay in enumeration algorithms
- Generating aspect graphs for nonconvex polyhedra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622253)
