<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://enfascination.com/wiki/skins/common/feed.css?303"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://enfascination.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Hansen_1997_caa</id>
		<title>Hansen 1997 caa - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://enfascination.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Hansen_1997_caa"/>
		<link rel="alternate" type="text/html" href="http://enfascination.com/wiki/index.php?title=Hansen_1997_caa&amp;action=history"/>
		<updated>2026-05-15T16:51:02Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.21.0rc5</generator>

	<entry>
		<id>http://enfascination.com/wiki/index.php?title=Hansen_1997_caa&amp;diff=2086&amp;oldid=prev</id>
		<title>Seth at 22:18, 27 March 2009</title>
		<link rel="alternate" type="text/html" href="http://enfascination.com/wiki/index.php?title=Hansen_1997_caa&amp;diff=2086&amp;oldid=prev"/>
				<updated>2009-03-27T22:18:42Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;bibtex&amp;gt;&lt;br /&gt;
@article{hansen1997caa,&lt;br /&gt;
  title={{Cluster analysis and mathematical programming}},&lt;br /&gt;
  author={Hansen, P. and Jaumard, B.},&lt;br /&gt;
  journal={Mathematical programming},&lt;br /&gt;
  volume={79},&lt;br /&gt;
  number={1},&lt;br /&gt;
  pages={191--215},&lt;br /&gt;
  year={1997},&lt;br /&gt;
  publisher={Springer}&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/bibtex&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thick review from the computer science community on clusering algorithms.  At the very end it has a few pages dedicated to heuristic techniques where my interests presumably lie.  &lt;br /&gt;
&lt;br /&gt;
&amp;quot;For many criteria, exact solution of large clustering problems is out of reach.  So there is room for heuristics.  Moreover, finding a good initial solution may be important in column generation (if it is well exploited..).&lt;br /&gt;
&amp;quot;&lt;br /&gt;
Meta heuristics have the most luck, sim annealing, Tabu and GAs.  Also the Variable Neighborhood Search is one they recommended.&lt;/div&gt;</summary>
		<author><name>Seth</name></author>	</entry>

	</feed>