BIP:二进制整数规划
“二进制整数规划”(Binary Integer Programming)在计算机科学领域,尤其是在程序集和算法优化中应用广泛。为便于书写与交流,该术语常被缩写为BIP。作为一种数学规划方法,它要求决策变量为二进制整数(0或1),常用于解决组合优化、资源分配等复杂问题。
Binary Integer Programming具体释义
Binary Integer Programming的英文发音
例句
- The proposed non-convex problem is approximated as a mix binary integer programming problem and solved by branch and bound algorithm with low complexity.
- 采用确定性变换将提出的非凸优化问题近似为混合二进制整数规划(BIP)问题,并采用低复杂度的分支界定算法求解。
- The optimal turned out slab pile ( TOSP ) problem in the slab yard of iron & steel industry is formulated as a binary integer programming model in this paper.
- 对钢铁企业板坯库中的最优倒垛问题建立了0和1整数规划模型。
- With mathematical modeling method, a mathematical optimization problem is transformed from original communication problem. We show that this problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity.
- 利用合理的数学建模将上述复杂的通信问题转化为一个最优化问题,其理论上是一个非线性混合二进制整数规划(BIP)问题,求解最优解的时间复杂度较高。
本站英语缩略词为个人收集整理,可供非商业用途的复制、使用及分享,但严禁任何形式的采集或批量盗用
若BIP词条信息存在错误、不当之处或涉及侵权,请及时联系我们处理:675289112@qq.com。