Is there a variation of the bounded knapsack problem with unknown weights/values?
$begingroup$
I've tried searching on google and other places, but can't seem to pin down anything solid. Is there any variation of the knapsack problem (or is it considered another problem entirely) where the weights/values are considered hidden until the full sequence is complete? I'm specifically thinking of such cases where (perhaps) the contribution of a single element is dependent on the configuration of its partner elements, and so assigning weights and values is incorrect until the whole "knapsack" has been loaded.
I'm not an expert on all existing problems, so apologies if this has just been formulated in another optimization problem entirely; I know it's related to the traveling salesman problem, but that still has the concept of distance between nodes, which again I'm interested in considering as hidden.
optimization
asked Dec 8 '18 at 16:08
fherderfherder
62
$endgroup$
add a comment |
$begingroup$
I've tried searching on google and other places, but can't seem to pin down anything solid. Is there any variation of the knapsack problem (or is it considered another problem entirely) where the weights/values are considered hidden until the full sequence is complete? I'm specifically thinking of such cases where (perhaps) the contribution of a single element is dependent on the configuration of its partner elements, and so assigning weights and values is incorrect until the whole "knapsack" has been loaded.
I'm not an expert on all existing problems, so apologies if this has just been formulated in another optimization problem entirely; I know it's related to the traveling salesman problem, but that still has the concept of distance between nodes, which again I'm interested in considering as hidden.
optimization
asked Dec 8 '18 at 16:08
fherderfherder
62
$endgroup$
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31
add a comment |
$begingroup$
I've tried searching on google and other places, but can't seem to pin down anything solid. Is there any variation of the knapsack problem (or is it considered another problem entirely) where the weights/values are considered hidden until the full sequence is complete? I'm specifically thinking of such cases where (perhaps) the contribution of a single element is dependent on the configuration of its partner elements, and so assigning weights and values is incorrect until the whole "knapsack" has been loaded.
I'm not an expert on all existing problems, so apologies if this has just been formulated in another optimization problem entirely; I know it's related to the traveling salesman problem, but that still has the concept of distance between nodes, which again I'm interested in considering as hidden.
optimization
asked Dec 8 '18 at 16:08
fherderfherder
62
$endgroup$
I've tried searching on google and other places, but can't seem to pin down anything solid. Is there any variation of the knapsack problem (or is it considered another problem entirely) where the weights/values are considered hidden until the full sequence is complete? I'm specifically thinking of such cases where (perhaps) the contribution of a single element is dependent on the configuration of its partner elements, and so assigning weights and values is incorrect until the whole "knapsack" has been loaded.
I'm not an expert on all existing problems, so apologies if this has just been formulated in another optimization problem entirely; I know it's related to the traveling salesman problem, but that still has the concept of distance between nodes, which again I'm interested in considering as hidden.
optimization
optimization
asked Dec 8 '18 at 16:08
fherderfherder
62
asked Dec 8 '18 at 16:08
fherderfherder
62
asked Dec 8 '18 at 16:08
fherderfherder
62
asked Dec 8 '18 at 16:08
fherderfherder
62
asked Dec 8 '18 at 16:08
fherderfherder
62
62
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31
add a comment |
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31
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%2f3031287%2fis-there-a-variation-of-the-bounded-knapsack-problem-with-unknown-weights-values%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%2f3031287%2fis-there-a-variation-of-the-bounded-knapsack-problem-with-unknown-weights-values%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
$begingroup$
sounds more like game theory and unknown values of a coalition
$endgroup$
– LinAlg
Dec 8 '18 at 16:18
$begingroup$
You might find this article relevant: arxiv.org/abs/1307.2806
$endgroup$
– Frederic Chopin
Dec 8 '18 at 16:31