<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Optimization on Engineering Playbook</title><link>https://learn.tanhdev.com/tags/optimization/</link><description>Recent content in Optimization on Engineering Playbook</description><image><title>Engineering Playbook</title><url>https://learn.tanhdev.com/vesviet.png</url><link>https://learn.tanhdev.com/vesviet.png</link></image><generator>Hugo</generator><language>vi</language><lastBuildDate>Sun, 16 Aug 2026 12:00:00 +0700</lastBuildDate><atom:link href="https://learn.tanhdev.com/tags/optimization/index.xml" rel="self" type="application/rss+xml"/><item><title>Phần 3 — Thuật toán phân bổ: Assignment Problem, Bin Packing &amp; VRP</title><link>https://learn.tanhdev.com/series/ecommerce-order-allocation/part-3-allocation-algorithms/</link><pubDate>Wed, 06 May 2026 20:30:00 +0700</pubDate><guid>https://learn.tanhdev.com/series/ecommerce-order-allocation/part-3-allocation-algorithms/</guid><description>Ba họ thuật toán cốt lõi cho bài toán phân bổ đơn hàng: Assignment Problem (phân công tối ưu), Bin Packing (xếp đơn vào tài xế) và Vehicle Routing Problem (VRP).</description></item><item><title>Phần 7 — Declarative Prompting với DSPy (2026)</title><link>https://learn.tanhdev.com/series/prompt-standard/part-7-declarative-prompting-dspy/</link><pubDate>Sat, 09 May 2026 11:05:00 +0700</pubDate><guid>https://learn.tanhdev.com/series/prompt-standard/part-7-declarative-prompting-dspy/</guid><description>Nếu bạn ngừng viết prompt bằng tay và để framework tự tối ưu thì sao? DSPy giới thiệu declarative signatures và automatic prompt compilation (Cập nhật 2026).</description></item></channel></rss>