SIAM Journal on Discrete Mathematics. 1996;9(3):365-376. doi: 10.1137/s089548019325900x Q21.02025

On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

求解组合线性规划的割平面算法的复杂性研究

DOI: 10.1137/s089548019325900x

摘要 查看摘要

Copyright © SIAM Journal on Discrete Mathematics. 中文内容为AI机器翻译，仅供参考！