Optimizing virtual backup allocation for middleboxes
In enterprise networks, network functions, such as address translation, firewall, and deep
packet inspection, are often implemented in middleboxes. Those can suffer from temporary …
packet inspection, are often implemented in middleboxes. Those can suffer from temporary …
Optimal multi-way number partitioning
The NP-hard number-partitioning problem is to separate a multiset S of n positive integers
into k subsets such that the largest sum of the integers assigned to any subset is minimized …
into k subsets such that the largest sum of the integers assigned to any subset is minimized …
A multicore-based algorithm for optimal multi-way number partitioning
Abstract The Multi-Way Number Partitioning (MWNP) problem is to divide a multiset of n
numbers into k subsets in such a way that the largest subset sum is minimized. MWNP is an …
numbers into k subsets in such a way that the largest subset sum is minimized. MWNP is an …
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem
The multidimensional multi-way number partitioning problem takes as input a set of n
vectors with a fixed dimension m≥ 2, and aims to find a partitioning of this set into k≥ 2 non …
vectors with a fixed dimension m≥ 2, and aims to find a partitioning of this set into k≥ 2 non …
[PDF][PDF] Optimal Sequential Multi-Way Number Partitioning.
Given a multiset of n positive integers, the NP-complete problem of number partitioning is to
assign each integer to one of k subsets, such that the largest sum of the integers assigned to …
assign each integer to one of k subsets, such that the largest sum of the integers assigned to …
Cached iterative weakening for optimal multi-way number partitioning
The NP-hard number-partitioning problem is to separate a multiset S of n positive integers
into k subsets, such that the largest sum of the integers assigned to any subset is minimized …
into k subsets, such that the largest sum of the integers assigned to any subset is minimized …
Efficient locally optimal number set partitioning for scheduling, allocation and fair selection
K Gokcesu, H Gokcesu - arxiv preprint arxiv:2109.04809, 2021 - arxiv.org
We study the optimization version of the set partition problem (where the difference between
the partition sums are minimized), which has numerous applications in decision theory …
the partition sums are minimized), which has numerous applications in decision theory …
A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization
K Gokcesu, H Gokcesu - arxiv preprint arxiv:2109.07882, 2021 - arxiv.org
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 …
absolute difference between the equal sized partitions' sums are minimized). While this …
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem
The Partitioning Min-Max Weighted Matching (PMMWM) problem, being a practical NP-hard
problem, integrates the task of partitioning the vertices of a bipartite graph into disjoint sets of …
problem, integrates the task of partitioning the vertices of a bipartite graph into disjoint sets of …
A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization
K Gokcesu, H Gokcesu - arxiv preprint arxiv:2203.05618, 2022 - arxiv.org
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 …
applications in the decision, learning and optimization literature. Even though the original …