搜索结果: 1-1 共查到“理学 Algorithmic and Complexity Results”相关记录1条 . 查询时间(0.176 秒)
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
Algorithmic and Complexity Results Maximal Lattice-Free Convex Sets Optimization and Control
2011/9/20
Abstract: We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced by Anderse...