mplrs: A scalable parallel vertex/facet enumeration code
Authors:
- 9 November 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 10 (2) , 267-302
Abstract
No abstract availableKeywords
All Related Versions
This publication has 41 references indexed in Scilit:
- Branch-and-Bound interval global optimization on shared memory multiprocessorsOptimization Methods and Software, 2008
- The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systemsScience of Computer Programming, 2008
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithmEuropean Journal of Operational Research, 2005
- Solving large quadratic assignment problems on computational gridsMathematical Programming, 2002
- Estimating the number of vertices of a polyhedronInformation Processing Letters, 2000
- Scheduling multithreaded computations by work stealingJournal of the ACM, 1999
- State of the art in parallel search techniques for discrete optimization problemsIEEE Transactions on Knowledge and Data Engineering, 1999
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactionsPhysical Review B, 1994
- Parallel depth first search. Part II. AnalysisInternational Journal of Parallel Programming, 1987