<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Snipplr</title>
    <description>Recent snippets posted on Snipplr.com</description>
    <link>https://snipplr.com/</link>
    <lastBuildDate>Tue, 09 Jun 2026 12:50:03 +0000</lastBuildDate>
    <item>
      <title>(MatLab) Simulated annealing for location allocation problem - mertnuhoglu</title>
      <link>https://snipplr.com/view/4281/simulated-annealing-for-location-allocation-problem</link>
      <description>&lt;p&gt;Simulated annealing heuristics applied to solve continuous location allocation problem.&lt;/p&gt;</description>
      <pubDate>Fri, 07 Dec 2007 15:42:00 UTC</pubDate>
      <guid>https://snipplr.com/view/4281/simulated-annealing-for-location-allocation-problem</guid>
    </item>
    <item>
      <title>(MatLab) Solving p-median location allocation problem with Lagrangian Relaxation heuristics - mertnuhoglu</title>
      <link>https://snipplr.com/view/4136/solving-pmedian-location-allocation-problem-with-lagrangian-relaxation-heuristics</link>
      <description>&lt;p&gt;&lt;/p&gt;</description>
      <pubDate>Wed, 14 Nov 2007 15:15:36 UTC</pubDate>
      <guid>https://snipplr.com/view/4136/solving-pmedian-location-allocation-problem-with-lagrangian-relaxation-heuristics</guid>
    </item>
    <item>
      <title>(MatLab) Shortest path heuristics (nearest neighborhood, 2 opt, farthest and arbitrary insertion) for travelling salesman problem - mertnuhoglu</title>
      <link>https://snipplr.com/view/4064/shortest-path-heuristics-nearest-neighborhood-2-opt-farthest-and-arbitrary-insertion-for-travelling-salesman-problem</link>
      <description>&lt;p&gt;&lt;/p&gt;</description>
      <pubDate>Sat, 03 Nov 2007 15:39:57 UTC</pubDate>
      <guid>https://snipplr.com/view/4064/shortest-path-heuristics-nearest-neighborhood-2-opt-farthest-and-arbitrary-insertion-for-travelling-salesman-problem</guid>
    </item>
  </channel>
</rss>
