Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re^2: Highest total sum path problem

by LanX (Cardinal)
on Mar 05, 2020 at 13:04 UTC ( #11113848=note: print w/replies, xml ) Need Help??

in reply to Re: Highest total sum path problem
in thread Highest total sum path problem

It really depends on the exact problem.

There could be a dual problem which has to be minimised. (The skipped cells that is).

In these cases one could use standard minimisation algorithms.

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery

Replies are listed 'Best First'.
Re^3: Highest total sum path problem
by baxy77bax (Deacon) on Mar 05, 2020 at 17:17 UTC
    That is true. But I have turned to the community like many times before because I have a task to solve and conditions passed down to me by a BI officer that has even vaguely described the problem than I did it here. (yes I simplified the problem but if i posted the obscured interaction it is aimed to solve i don't think anyone would even try to participate, let alone ask for claricifations). Yes the problem is not clearly specified here and through interactions on this forum I believe the community is doing exactly what its intent is. By posting your comments you are helping me. Those that do not want to help, need not to post, those that do, thank you !!

    Really ppl, thank you all !!

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://11113848]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (8)
As of 2021-03-04 09:34 GMT
Find Nodes?
    Voting Booth?
    My favorite kind of desktop background is:

    Results (101 votes). Check out past polls.