An adaptive algorithm for vector partitioning
From MaRDI portal
Recommendations
- The vectorization of the partition problem
- Adaptive partitioning
- A parallelization of adaptive task partitioning algorithms
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Graph partitioning via adaptive spectral techniques
- An adaptive generic sorting algorithm that uses variable partitioning∗
- Adaptive partitioning techniques for ordinary differential equations
- Approximation algorithms for array partitioning problems
- The complexity of vector partition
Cited in
(8)- Stable Clusterings and the Cones of Outer Normals
- Circuits in extended formulations
- The vector partition problem for convex objective functions.
- Optimal partitions having disjoint convex and conic hulls
- Polynomial traffic demand polytope partitioning
- Good clusterings have large volume
- The vectorization of the partition problem
- Convex integer maximization via Graver bases
This page was built for publication: An adaptive algorithm for vector partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810893)