<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chaoyuzhang的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chaoyuzhang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chaoyuzhang]]></copyright><item><title><![CDATA[103、商品布局]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/153314926</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/153314926</guid><author>chaoyuzhang</author><pubDate>Wed, 15 Oct 2025 10:12:12 +0800</pubDate><description><![CDATA[有很多商品，每类商品有一定的销量和库存，隔一段时间会进行送货，同时也有一些货架，问如何将这些商品放在这些货架上，使得整体的拣货效率较高。表示第i个商品是否从第j列第k个库位开始放。表示第i个商品是否从第j个库位开始放。分别表示第i个商品的销量和库存，分别表示第i个商品的销量和库存，]]></description><category></category></item><item><title><![CDATA[102、排产]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152804087</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152804087</guid><author>chaoyuzhang</author><pubDate>Thu, 09 Oct 2025 16:00:54 +0800</pubDate><description><![CDATA[【代码】102、排产。]]></description><category></category></item><item><title><![CDATA[101、排班]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152211907</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152211907</guid><author>chaoyuzhang</author><pubDate>Sun, 28 Sep 2025 11:43:17 +0800</pubDate><description><![CDATA[【代码】101、排班。]]></description><category></category></item><item><title><![CDATA[100、uplift]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152119304</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/152119304</guid><author>chaoyuzhang</author><pubDate>Fri, 26 Sep 2025 11:03:02 +0800</pubDate><description><![CDATA[为了解决这个问题，我们引入了人群的概念，把某些具有相同特征的人划分到一个集合里，这样在该人群下，正负的样本都有了，那么我们就可以开始比较他在是否发放红包对他的影响了。我们收集到的数据，是每个人在历史上是否被发放了红包，以及是否购买，我们无法获取某个人在两种情况下的是否购买行为。C给红包，遇到F就是赚的，遇到G，只是明面上花了，但其实由于其并没有购买，故红包投的钱是没有生效的。通俗的来看，只要识别了原始的购买意向，B都不给红包，C都给红包就可以了。对于D：是否发放其都会产生购买行为，发放红包会带来成本上升。]]></description><category></category></item><item><title><![CDATA[86、LRP]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128026654</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128026654</guid><author>chaoyuzhang</author><pubDate>Fri, 26 Sep 2025 10:53:16 +0800</pubDate><description><![CDATA[【代码】86、LRP。]]></description><category></category></item><item><title><![CDATA[99、git 超时问题]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149125724</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149125724</guid><author>chaoyuzhang</author><pubDate>Fri, 04 Jul 2025 21:59:01 +0800</pubDate><description><![CDATA[报错： Push failed。]]></description><category></category></item><item><title><![CDATA[98、图染色问题]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149046408</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149046408</guid><author>chaoyuzhang</author><pubDate>Tue, 01 Jul 2025 14:36:12 +0800</pubDate><description><![CDATA[【代码】98、图染色问题。]]></description><category></category></item><item><title><![CDATA[97、Flow shop scheduling问题]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149019554</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/149019554</guid><author>chaoyuzhang</author><pubDate>Mon, 30 Jun 2025 11:34:49 +0800</pubDate><description><![CDATA[Flow shop scheduling问题]]></description><category></category></item><item><title><![CDATA[96、数图求解（整数规划建模求解）]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/147772838</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/147772838</guid><author>chaoyuzhang</author><pubDate>Wed, 07 May 2025 19:38:39 +0800</pubDate><description><![CDATA[【代码】96、数独求解（整数规划建模求解）]]></description><category></category></item><item><title><![CDATA[95、判断点与多边形是否存在包含关系]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135700115</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135700115</guid><author>chaoyuzhang</author><pubDate>Fri, 19 Jan 2024 15:50:51 +0800</pubDate><description><![CDATA[【代码】95、判断点与多边形是否存在包含关系。]]></description><category></category></item><item><title><![CDATA[94、计算多边形面积]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135700052</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135700052</guid><author>chaoyuzhang</author><pubDate>Fri, 19 Jan 2024 15:49:49 +0800</pubDate><description><![CDATA[【代码】94、计算多边形面积。]]></description><category></category></item><item><title><![CDATA[93、Geohash算法实现]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135276076</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/135276076</guid><author>chaoyuzhang</author><pubDate>Thu, 28 Dec 2023 18:38:09 +0800</pubDate><description><![CDATA[【代码】93、Geohash算法实现。]]></description><category></category></item><item><title><![CDATA[92、船员调度]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133649698</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133649698</guid><author>chaoyuzhang</author><pubDate>Sat, 07 Oct 2023 17:58:57 +0800</pubDate><description><![CDATA[船员调度]]></description><category></category></item><item><title><![CDATA[91、最小生成树]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133322452</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133322452</guid><author>chaoyuzhang</author><pubDate>Tue, 26 Sep 2023 19:50:13 +0800</pubDate><description><![CDATA[最小生成树]]></description><category></category></item><item><title><![CDATA[90、一维装箱]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133269602</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133269602</guid><author>chaoyuzhang</author><pubDate>Mon, 25 Sep 2023 11:20:51 +0800</pubDate><description><![CDATA[一维装箱。]]></description><category></category></item><item><title><![CDATA[89、二部图匹配问题]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133143859</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/133143859</guid><author>chaoyuzhang</author><pubDate>Thu, 21 Sep 2023 18:55:41 +0800</pubDate><description><![CDATA[二部图匹配问题。]]></description><category></category></item><item><title><![CDATA[88、元素柱击打问题建模]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128779178</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128779178</guid><author>chaoyuzhang</author><pubDate>Sat, 28 Jan 2023 16:34:15 +0800</pubDate><description><![CDATA[元素柱击打问题建模]]></description><category></category></item><item><title><![CDATA[87、housePrice]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128479185</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/128479185</guid><author>chaoyuzhang</author><pubDate>Thu, 29 Dec 2022 11:46:36 +0800</pubDate><description><![CDATA[housePrice。]]></description><category></category></item><item><title><![CDATA[85、使用高德api获取经纬度，导航距离]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/124729681</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/124729681</guid><author>chaoyuzhang</author><pubDate>Mon, 04 Jul 2022 21:22:24 +0800</pubDate><description><![CDATA[使用高德api获取经纬度，导航距离


2]]></description><category></category></item><item><title><![CDATA[84、浅谈原始对偶算法]]></title><link>https://blog.youkuaiyun.com/chaoyuzhang/article/details/121560258</link><guid>https://blog.youkuaiyun.com/chaoyuzhang/article/details/121560258</guid><author>chaoyuzhang</author><pubDate>Fri, 26 Nov 2021 19:13:07 +0800</pubDate><description><![CDATA[原始对偶算法理解过很多次，每一个的理解都不一样，这次将其记录一下

这里定义原始问题为资源有限下的价值最大化模型，A是资源消耗矩阵，b是资源量，c是产品价值向量

max cTx

s.t. Ax &lt;= b



对偶的定义是啥呢，它先组合一下原始的约束，组合权重用y表示，那么组合出来的向量为ATy，我约束其在每个维度的值都大于c，强行赋一个定义可以是保证价值情况下的资源最小化，这样对偶问题就被构造出来了，不难可以知道bTy &gt;= xTATy&gt;= xTc，

min bTy

s.t. .]]></description><category></category></item></channel></rss>