Talk:Transportation problem: Difference between revisions

Content added Content deleted

Inline

Revision as of 11:33, 27 August 2013 (view source) rosettacode>Русский mNo edit summary ← Older edit		Revision as of 08:38, 25 January 2014 (view source) rosettacode>Русский No edit summary Newer edit →
Line 5:		Line 5:

	:I've been too busy with (many!) other things for much Rosetta Code problem solving. I've only been doing things the past few days because I've had some time off work (long weekend/public holiday/:-) :-) :-)). –[[User:Dkf\|Donal Fellows]] ([[User talk:Dkf\|talk]]) 21:51, 25 August 2013 (UTC)		:I've been too busy with (many!) other things for much Rosetta Code problem solving. I've only been doing things the past few days because I've had some time off work (long weekend/public holiday/:-) :-) :-)). –[[User:Dkf\|Donal Fellows]] ([[User talk:Dkf\|talk]]) 21:51, 25 August 2013 (UTC)

			* So, added the implementation in the language with English lexical base. Now the algorithm will be more clear. It is based on the construction of the redistribution cycle. It is a closed line connecting certain way the occupied cells of the distribution plan. After building the cycle and redistributing the supplies, the procedure is repeated until you reach the optimal supply plan. [[User:Русский\|Русский]] ([[User talk:Русский\|talk]]) 08:38, 25 January 2014 (UTC)