<div>
<a href="http://www.google.com/url?sa=U&start=2&q=http://aimsrv1.fee.uva.nl/koen/attachme.nsf/view/6FFCA9BBCB5114FBC1256C320030FBAC/%24file/Chapter02.pdf&ei=vsDlSZGRNsqLsAaH4b2pCw&usg=AFQjCNH9hfKz39IQJKWoAXiFyFESWN2WPg" rel="ugc">http://www.google.com/url?sa=U&start=2&q=http://aimsrv1.fee.uva.nl/koen/attachme.nsf/view/6FFCA9BBCB5114FBC1256C320030FBAC/%24file/Chapter02.pdf&ei=vsDlSZGRNsqLsAaH4b2pCw&usg=AFQjCNH9hfKz39IQJKWoAXiFyFESWN2WPg</a>
</div>


http://www.google.com/url?sa=U&start=2&q=http://aimsrv1.fee.uva.nl/koen/attachme.nsf/view/6FFCA9BBCB5114FBC1256C320030FBAC/%24file/Chapter02.pdf&ei=vsDlSZGRNsqLsAaH4b2pCw&usg=AFQjCNH9hfKz39IQJKWoAXiFyFESWN2WPg [http://www.google.com/url?sa=U&start=2&q=http://aimsrv1.fee.uva.nl/koen/attachme.nsf/view/6FFCA9BBCB5114FBC1256C320030FBAC/%24file/Chapter02.pdf&ei=vsDlSZGRNsqLsAaH4b2pCw&usg=AFQjCNH9hfKz39IQJKWoAXiFyFESWN2WPg]

<div>
I need Java Code for Wagner Whitin... Thank you for alternative solution algorithms though... 
</div>


I need Java Code for Wagner Whitin... Thank you for alternative solution algorithms though...

<div>
There's no such a thing around. You'll have to write your own code out of the pseudo :)
</div>


There's no such a thing around. You'll have to write your own code out of the pseudo :)

<div>
Yeah Thank you I know How to google it. I asked for anybody who coded before...
</div>


Yeah Thank you I know How to google it. I asked for anybody who coded before...

<div>
<div class="content wysiwyg-content">
Hi guys,<br />
<br />
Does anyone know Wagner Whitin algorithm and have code for that?<br />
<br />
Algorithm is recursive. For example we have 5 nodes and there is a cost function of going from one node to another. We start from the end and find for each node the min cost that takes us from that node to the end. So we are finding the optimal cost...<br />
<br />
Thank you,<br />
<br />
Ozgur
</div>
</div>


Hi guys,

Does anyone know Wagner Whitin algorithm and have code for that?

Algorithm is recursive. For example we have 5 nodes and there is a cost function of going from one node to another. We start from the end and find for each node the min cost that takes us from that node to the end. So we are finding the optimal cost...

Thank you,

Ozgur

Wagner Whitin

Java is a platform-independent, object-oriented programming language and run-time environment, designed to have as few implementation dependencies as possible such that developers can write one set of code across all platforms using libraries. Most devices will not run Java natively, and require a run-time component to be installed in order to execute a Java program.

Java

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.