A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization
Data Structures and Algorithms
2022-03-14 v1 Machine Learning
Combinatorics
Optimization and Control
Abstract
We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard and requires exponential time complexity algorithms; we formulate an easier optimization problem, where our goal is to find a solution that is locally optimal. We propose a linearithmic time complexity algorithm that can produce such a locally optimal solution. Our method is robust against the input and requires neither positive nor integer inputs.
Cite
@article{arxiv.2203.05618,
title = {A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization},
author = {Kaan Gokcesu and Hakan Gokcesu},
journal= {arXiv preprint arXiv:2203.05618},
year = {2022}
}