\texttt{mplrs}: a scalable parallel vertex/facet enumeration code
From MaRDI portal
Publication:1621690
DOI10.1007/S12532-017-0129-YzbMath1400.90222arXiv1511.06487OpenAlexW2963481904MaRDI QIDQ1621690
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06487
Related Items (7)
Hyperplane Arrangements in polymake ⋮ Parallel enumeration of triangulations ⋮ Data-driven quadratic stabilization and LQR control of LTI systems ⋮ The statistical analysis for Sombor indices in a random polygonal chain networks ⋮ The Newton polytope of the discriminant of a quaternary cubic form ⋮ mplrs ⋮ Directed acyclic decomposition of Kuramoto equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster geometric algorithms via dynamic determinant computation
- The power of pyramid decomposition in Normaliz
- Parallel depth first search. II: Analysis
- A parallel alpha/beta tree searching algorithm
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Estimating the number of vertices of a polyhedron
- On parallel branch and bound frameworks for global optimization
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- The parallel search bench ZRAM and its applications
- Solving large quadratic assignment problems on computational grids
- Reverse search for enumeration
- Could we use a million cores to solve an integer program?
- A parallel branch and bound algorithm for the maximum labelled clique problem
- Computing convex hulls and counting integer points with \texttt{polymake}
- A Portable Parallel Implementation of the lrs Vertex Enumeration Code
- Early Estimates of the Size of Branch-and-Bound Trees
- Embarrassingly Parallel Search in Constraint Programming
- Scheduling multithreaded computations by work stealing
- HordeSat: A Massively Parallel Portfolio SAT Solver
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- Lectures on Polytopes
- Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums
- Combinatorial Analysis and Computers
- AND/OR Branch-and-Bound on a Computational Grid
- Bounds on Multiprocessing Timing Anomalies
- Geometry of cuts and metrics
- Introduction to global optimization.
This page was built for publication: \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
