<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lagrangian Relaxation on Shai Asher</title><link>https://slow-is-smooth.io/tags/lagrangian-relaxation/</link><description>Recent content in Lagrangian Relaxation on Shai Asher</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Tue, 27 Oct 2026 12:00:00 +0200</lastBuildDate><atom:link href="https://slow-is-smooth.io/tags/lagrangian-relaxation/index.xml" rel="self" type="application/rss+xml"/><item><title>The Cleaning Robot Puzzle: A Price on Every Move</title><link>https://slow-is-smooth.io/blog/the-cleaning-robot-puzzle-a-price-on-every-move/</link><pubDate>Tue, 27 Oct 2026 12:00:00 +0200</pubDate><guid>https://slow-is-smooth.io/blog/the-cleaning-robot-puzzle-a-price-on-every-move/</guid><description>&lt;p&gt;&lt;em&gt;With a battery of five moves, Part 2&amp;rsquo;s robot collects 14 units of dirt, and the best route collects 16. Charge the robot 3¼ units of dirt for every move it makes, and it can be proved that no route collects more than 17. A drawing shows why no price, however well chosen, can prove 16.&lt;/em&gt;&lt;/p&gt;</description></item></channel></rss>