Balanced subset sum problem
$begingroup$
Suppose I have a set of $2N$ items with weights $w_0, w_1, ldots, w_{2N-1}$. I want to identify the two most "balanced" sets of $k$ items each, where $k$ is not given but limited to the range $k_min leq k leq N$.
More specifically: Identify the two disjunct subsets $A = {a_0, a_1, ldots a_{k-1}}$ and $B = {b_0, b_1, ldots a_{k-1}}$ subject to the following conditions:
- all the $a_i, b_i in [0,2N-1]$
- $A cap B = varnothing$
- both sets have equal cardinality $k$ where $k_min leq k leq N$
- the following quantity $epsilon$ is minimized:
$$ begin{align}
epsilon &= frac{|W_A-W_B|}{W_A+W_B} cr
W_A &= sumlimits_{i=0}^{k-1}w_{a_i} cr
W_B &= sumlimits_{i=0}^{k-1}w_{b_i} cr
end{align}$$
Is this a known problem? (I found Is there a "balanced knapsacks" problem with a known result? which is similar)
In my case the value of $N$ is not very large (under 50) so I don't really care about proving NP-hard, I just want to know a good strategy.
combinatorics
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
$endgroup$
add a comment |
$begingroup$
Suppose I have a set of $2N$ items with weights $w_0, w_1, ldots, w_{2N-1}$. I want to identify the two most "balanced" sets of $k$ items each, where $k$ is not given but limited to the range $k_min leq k leq N$.
More specifically: Identify the two disjunct subsets $A = {a_0, a_1, ldots a_{k-1}}$ and $B = {b_0, b_1, ldots a_{k-1}}$ subject to the following conditions:
- all the $a_i, b_i in [0,2N-1]$
- $A cap B = varnothing$
- both sets have equal cardinality $k$ where $k_min leq k leq N$
- the following quantity $epsilon$ is minimized:
$$ begin{align}
epsilon &= frac{|W_A-W_B|}{W_A+W_B} cr
W_A &= sumlimits_{i=0}^{k-1}w_{a_i} cr
W_B &= sumlimits_{i=0}^{k-1}w_{b_i} cr
end{align}$$
Is this a known problem? (I found Is there a "balanced knapsacks" problem with a known result? which is similar)
In my case the value of $N$ is not very large (under 50) so I don't really care about proving NP-hard, I just want to know a good strategy.
combinatorics
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
$endgroup$
add a comment |
$begingroup$
Suppose I have a set of $2N$ items with weights $w_0, w_1, ldots, w_{2N-1}$. I want to identify the two most "balanced" sets of $k$ items each, where $k$ is not given but limited to the range $k_min leq k leq N$.
More specifically: Identify the two disjunct subsets $A = {a_0, a_1, ldots a_{k-1}}$ and $B = {b_0, b_1, ldots a_{k-1}}$ subject to the following conditions:
- all the $a_i, b_i in [0,2N-1]$
- $A cap B = varnothing$
- both sets have equal cardinality $k$ where $k_min leq k leq N$
- the following quantity $epsilon$ is minimized:
$$ begin{align}
epsilon &= frac{|W_A-W_B|}{W_A+W_B} cr
W_A &= sumlimits_{i=0}^{k-1}w_{a_i} cr
W_B &= sumlimits_{i=0}^{k-1}w_{b_i} cr
end{align}$$
Is this a known problem? (I found Is there a "balanced knapsacks" problem with a known result? which is similar)
In my case the value of $N$ is not very large (under 50) so I don't really care about proving NP-hard, I just want to know a good strategy.
combinatorics
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
$endgroup$
Suppose I have a set of $2N$ items with weights $w_0, w_1, ldots, w_{2N-1}$. I want to identify the two most "balanced" sets of $k$ items each, where $k$ is not given but limited to the range $k_min leq k leq N$.
More specifically: Identify the two disjunct subsets $A = {a_0, a_1, ldots a_{k-1}}$ and $B = {b_0, b_1, ldots a_{k-1}}$ subject to the following conditions:
- all the $a_i, b_i in [0,2N-1]$
- $A cap B = varnothing$
- both sets have equal cardinality $k$ where $k_min leq k leq N$
- the following quantity $epsilon$ is minimized:
$$ begin{align}
epsilon &= frac{|W_A-W_B|}{W_A+W_B} cr
W_A &= sumlimits_{i=0}^{k-1}w_{a_i} cr
W_B &= sumlimits_{i=0}^{k-1}w_{b_i} cr
end{align}$$
Is this a known problem? (I found Is there a "balanced knapsacks" problem with a known result? which is similar)
In my case the value of $N$ is not very large (under 50) so I don't really care about proving NP-hard, I just want to know a good strategy.
combinatorics
combinatorics
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
asked Dec 21 '18 at 16:44
Jason SJason S
2,04811617
2,04811617
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048683%2fbalanced-subset-sum-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048683%2fbalanced-subset-sum-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown