<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Combinatorial Optimization with Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1611.09940/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1611.09940/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Combinatorial Optimization with Reinforcement Learning — mentioned by sytelus</title><link>https://news.ycombinator.com/item?id=16357246</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.09940:16357246</guid><pubDate>Mon, 12 Feb 2018 08:06:49 GMT</pubDate><description>&lt;p&gt;These are the type of articles that makes HN worth looking in to every once in while :). The circuit routing is indeed worth $100M problem. And it&amp;#x27;s going to remain unsolved in classical sense because its NP-Hard. The reason this is very interesting problem is that basic version of the problem is fairly easy to specify: You are given bunch of polygons, each with few fixed points on it. You are also given series of sets, each containing list of points that must be connected together. Can you come up with connections that has minimum crossing with each other (see Wikipedia [1] for more formal…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.09940/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Neural Combinatorial Optimization with Reinforcement Learning — HN submission</title><link>https://news.ycombinator.com/item?id=13332692</link><guid isPermaLink="false">urn:hackerpapers:submission:1611.09940:13332692</guid><pubDate>Fri, 06 Jan 2017 00:03:07 GMT</pubDate><description>&lt;p&gt;Neural Combinatorial Optimization with Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1611.09940/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
