go ahead... be a heretic | |
PerlMonks |
Re^2: Highest total sum path problemby LanX (Saint) |
on Mar 05, 2020 at 13:04 UTC ( [id://11113848]=note: print w/replies, xml ) | Need Help?? |
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
In Section
Seekers of Perl Wisdom
|
|