Heuristic Algorithms for Balanced Multi-way Number Partitioning
Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, bala...
Saved in:
Main Authors: | ZHANG, Jilian, MOURATIDIS, Kyriakos, PANG, Hwee Hwa |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1359 https://ink.library.smu.edu.sg/context/sis_research/article/2358/viewcontent/IJCAI11.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
On the number of nonnegative sums for semi-partitions
by: Ku, Cheng Yeaw, et al.
Published: (2022) -
A problem on clique partitions of regular graphs
by: Campena, Francis Joseph H., et al.
Published: (2018) -
On the hardness of approximating the permanent of structured matrices
by: Codenotti, B., et al.
Published: (2016) -
Learning algorithm for the uniform graph partitioning problem
by: Chua, C.B., et al.
Published: (2014) -
2-D lattice CA and configurable CA for pseudorandom number generation
by: MARIE THERESE ROBLES QUIETA
Published: (2019)