<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.6.2" -->
<rss version="0.92">
<channel>
	<title>'D'atabases : The Hidden 'D'NA of our lives</title>
	<link>http://blogs.embarcadero.com/ritesha</link>
	<description>Just another Embarcadero Blogs weblog</description>
	<lastBuildDate>Tue, 15 Feb 2011 13:54:18 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Almost TSP!! : Travelling Salesman Problem Solution through PL/SQL</title>
		<description>
Hi!!!!
 
/* PROBLEM STATEMENT
Here, the salesman is given the distance chart by his/her manager based on which
(s)he has to cover all the cities in the distance chart but ensure that (s)he 
covers the MINIMUM DISTANCE. For better text, read http://en.wikipedia.org/wiki/Travelling_salesman_problem.
*/


 


 
 
 
/
drop table salesmans_scrambled_dist_chart;
create table salesmans_scrambled_dist_chart
(
      source      varchar2(5),
      destination varchar2(5),
      distance    number(5,0)
);
truncate table ...</description>
		<link>http://blogs.embarcadero.com/ritesha/2011/02/15/travelling-salesman-problem/</link>
			</item>
	<item>
		<title>Oracle Package / Stored Procedure to generate distinct scrambled combination of given elements</title>
		<description>Due to my 'lazy' mind fidgeting around, I came up with the following :-)


	the following article gives the complete code (yes, it's redistributable!) to generate the distinct alphabets that are possible, if the list of alphabets to be used are known [in the table - elements_for_scramble] (through Oracle PL/SQL - ...</description>
		<link>http://blogs.embarcadero.com/ritesha/2011/02/14/scrambler-oracle_package/</link>
			</item>
</channel>
</rss>

