Minimizing sequential sumSplit up $n in mathbb{N}$ into sum of naturals with maximum LCMMinimizing Sum of...
Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible
What are substitutions for coconut in curry?
The difference between「N分で」and「後N分で」
Recruiter wants very extensive technical details about all of my previous work
Python if-else code style for reduced code for rounding floats
How to explain that I do not want to visit a country due to personal safety concern?
What's the meaning of “spike” in the context of “adrenaline spike”?
PTIJ: Who should I vote for? (21st Knesset Edition)
My Graph Theory Students
How to make healing in an exploration game interesting
Gantt Chart like rectangles with log scale
Can I use USB data pins as power source
What do Xenomorphs eat in the Alien series?
SOQL: Populate a Literal List in WHERE IN Clause
Why do Australian milk farmers need to protest supermarkets' milk price?
Dice rolling probability game
Why is the President allowed to veto a cancellation of emergency powers?
Who is flying the vertibirds?
Sailing the cryptic seas
Hacking a Safe Lock after 3 tries
What is a^b and (a&b)<<1?
Are ETF trackers fundamentally better than individual stocks?
Awsome yet unlucky path traversal
Should we release the security issues we found in our product as CVE or we can just update those on weekly release notes?
Minimizing sequential sum
Split up $n in mathbb{N}$ into sum of naturals with maximum LCMMinimizing Sum of ProductProject Euler's Problem Number 88Give an algorithm that computes a fair driving schedule for all people in a carpool over $d$ daysProve that there always exists a fair driving scheduleIs this a valid example of a poset?Why no Forward Dynamic Programming in stochastic case?Dynamic Programming Algorithm RequirementsKnapsack problem approximation algorithmFind the maximum score in a game on array
$begingroup$
For $S:=(s_i)_{i=1}^{n(k-1)+1},,s_iinoverline{R^-}$ for some natural numbers $n$ and $k$, define operation $T(j)S:=(s_1,cdots,s_{j-1},sum_{i=j}^k s_i,s_{j+k},cdots,s_{n(k-1)+1})$ for $1le jle (n-1)(k-1)+1$. What is the sequence $(j_p)_{p=1}^n$ that minimizes the single element in $T(j_n)circ T(j_{n-1})circcdots circ T(p_1),S$?
We can certainly apply a dynamic programming algorithm to this problem. But is there a shortcut that depends on some properties of a given sequence $S$?
optimization algorithms dynamic-programming
$endgroup$
add a comment |
$begingroup$
For $S:=(s_i)_{i=1}^{n(k-1)+1},,s_iinoverline{R^-}$ for some natural numbers $n$ and $k$, define operation $T(j)S:=(s_1,cdots,s_{j-1},sum_{i=j}^k s_i,s_{j+k},cdots,s_{n(k-1)+1})$ for $1le jle (n-1)(k-1)+1$. What is the sequence $(j_p)_{p=1}^n$ that minimizes the single element in $T(j_n)circ T(j_{n-1})circcdots circ T(p_1),S$?
We can certainly apply a dynamic programming algorithm to this problem. But is there a shortcut that depends on some properties of a given sequence $S$?
optimization algorithms dynamic-programming
$endgroup$
add a comment |
$begingroup$
For $S:=(s_i)_{i=1}^{n(k-1)+1},,s_iinoverline{R^-}$ for some natural numbers $n$ and $k$, define operation $T(j)S:=(s_1,cdots,s_{j-1},sum_{i=j}^k s_i,s_{j+k},cdots,s_{n(k-1)+1})$ for $1le jle (n-1)(k-1)+1$. What is the sequence $(j_p)_{p=1}^n$ that minimizes the single element in $T(j_n)circ T(j_{n-1})circcdots circ T(p_1),S$?
We can certainly apply a dynamic programming algorithm to this problem. But is there a shortcut that depends on some properties of a given sequence $S$?
optimization algorithms dynamic-programming
$endgroup$
For $S:=(s_i)_{i=1}^{n(k-1)+1},,s_iinoverline{R^-}$ for some natural numbers $n$ and $k$, define operation $T(j)S:=(s_1,cdots,s_{j-1},sum_{i=j}^k s_i,s_{j+k},cdots,s_{n(k-1)+1})$ for $1le jle (n-1)(k-1)+1$. What is the sequence $(j_p)_{p=1}^n$ that minimizes the single element in $T(j_n)circ T(j_{n-1})circcdots circ T(p_1),S$?
We can certainly apply a dynamic programming algorithm to this problem. But is there a shortcut that depends on some properties of a given sequence $S$?
optimization algorithms dynamic-programming
optimization algorithms dynamic-programming
edited Mar 10 at 23:32
Hans
asked Mar 10 at 22:15
HansHans
5,03421232
5,03421232
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%2f3142988%2fminimizing-sequential-sum%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%2f3142988%2fminimizing-sequential-sum%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