An adaptive algorithm for vector partitioning

DOI10.1023/A:1022417803474MaRDI QIDQ1810893zbMATH OpenFDO

Authors Komei Fukuda, Shmuel Onn, V. Rosta

Publication date 9 June 2003

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1022417803474

zbMATH Keywords

combinatorial optimizationoutput-sensitivepartition polytopepolytope diametervertex enumeration

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial optimization (90C27)

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

(10)

• Convex integer maximization via Graver bases
• Optimal partitions having disjoint convex and conic hulls
• The complexity of vector partition
• The vector partition problem for convex objective functions.
• Polynomial traffic demand polytope partitioning
• Stable Clusterings and the Cones of Outer Normals
• A Polynomial Time Algorithm for Shaped Partition Problems
• Good clusterings have large volume
• Circuits in extended formulations
• The vectorization of the partition problem

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)