<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Relaxation on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/relaxation/</link><description>Recent content in Relaxation on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:15:51 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/relaxation/index.xml" rel="self" type="application/rss+xml"/><item><title>Integer Programming</title><link>https://abaj.ai/wiki/ccs/programming/paradigms/integer/</link><pubDate>Fri, 10 Jul 2026 01:43:39 +1000</pubDate><guid>https://abaj.ai/wiki/ccs/programming/paradigms/integer/</guid><description>&lt;p>take a &lt;a
 href="https://abaj.ai/wiki/ccs/programming/paradigms/linear/"
 
 
>linear program&lt;/a> and add one word — &lt;em>integer&lt;/em> — and the complexity class jumps from polynomial to NP-hard. that word buys expressive power nothing continuous can match: yes/no decisions, either/or logic, fixed costs, sequencing, assignment. integer programming is the lingua franca of operations research precisely because &amp;ldquo;decide&amp;rdquo; is not a convex verb.&lt;span class="margin-note" data-note="commercial solvers — gurobi, cplex, scip — routinely crack instances with millions of variables, np-hardness notwithstanding. hard in the worst case is not hard on your case">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>
&lt;/p></description></item></channel></rss>