Corpus ID: 237532303

A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization

@inproceedings{Gokcesu2021AQT,
  title={A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization},
  author={Kaan Gokcesu and Hakan Gokcesu},
  year={2021}
}
We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions’ sums are minimized). While this problem is NP-hard and requires exponential complexity to solve in general, we have formulated a weaker version of this NP-hard problem, where the goal is to find a locally optimal solution. The local optimality considered in our work is under any swap between the opposing partitions’ element pairs. To this end, we… Expand

References

SHOWING 1-10 OF 55 REFERENCES
Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection
TLDR
It is shown that the proposed algorithms can find a locally optimal solution in near linear time and require neither positive nor integer elements in the input set, hence, they are more widely applicable. Expand
Search Strategies for Optimal Multi-Way Number Partitioning
TLDR
This work develops a new optimal algorithm for multi-way number partitioning that outperforms the previous state-of-the-art by up to four orders of magnitude, and reduces average runtime on the largest benchmarks from several hours to less than a second. Expand
Cached Iterative Weakening for Optimal Multi-Way Number Partitioning
TLDR
A new algorithm, cached iterative weakening (CIW), is presented, for solving the NP-hard number-partitioning problem optimally, which provides one algorithm which outperforms all previous algorithms for k ≥ 4 and run times are up to two orders of magnitude faster. Expand
Optimal Multi-Way Number Partitioning
TLDR
Algorithms for solving multi-way number-partitioning problems optimally, which fall into three categories: sequential number partitioning (SNP), a branch-and-bound algorithm; binary-search improved bin completion (BSIBC), a bin-packing algorithm; and cached iterative weakening (CIW), an iterative weaken algorithm. Expand
A Complete Anytime Algorithm for Number Partitioning
  • R. Korf
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1998
TLDR
A new algorithm, called Complete Karmarkar-Karp (CKK), is presented, that optimally solves the general number-partitioning problem, and significantly outperforms the best previously-known algorithms for large problem instances. Expand
Multi-Way Number Partitioning
  • R. Korf
  • Mathematics, Computer Science
  • IJCAI
  • 2009
TLDR
Two new linear-space algorithms for multi-way partitioning are developed and demonstrated, each outperform the previous state of the art by orders of magnitude, and it is suggested that their asymptotic growth is less than that of previous algorithms. Expand
Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles
TLDR
This work investigates the problem of online learning of mixable loss functions in a dynamic environment and introduces online mixture schemes that asymptotically achieves the performance of the best dynamic estimation sequence of the switching oracle with optimal regret redundancies. Expand
Improved Bin Completion for Optimal Bin Packing and Number Partitioning
TLDR
It is shown that improved BC is up to five orders of magnitude faster than a state-of-the-art BCP algorithm on problems with relatively few bins and how to use number partitioning to generate difficult bin-packing instances. Expand
Equal sum subsets: Complexity of variations
TLDR
This paper investigates and shows NP-hardness for the Equal Sum Subsets from Two Sets problem and its variations, where the authors are given two sets and they need to nd two subsets of equal sum. Expand
A Hybrid Recursive Multi-Way Number Partitioning Algorithm
  • R. Korf
  • Mathematics, Computer Science
  • IJCAI
  • 2011
TLDR
This work introduces an improved algorithm for optimal multiway partitioning, by combining several existing algorithms with some new extensions, and demonstrates orders of magnitude speedup over the previous state of the art. Expand
...
1
2
3
4
5
...