搜索资源列表
abc
- 使用VC++求解整数规划问题的输出解.堪称经典-Integer programming problem
lagrangian-relax
- 拉格朗日插值求解最优，适用于混合整数规划问题模型-Lagrange interpolation for solving optimal, suitable for mixed-integer programming problem model
zuidaziduanhe
- 给定整数序列，用动态规划算法求出最大子段和，用c语言实现-Given the sequence of integers, find the maximum dynamic programming algorithm and sub-segment, with the c language