A note on non-degenerate integer programs with small sub-determinants.
Operations Research Letters(2016)
摘要
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by A∈Zm×n and find an algorithm to solve such problems in polynomial-time provided that both the largest absolute value of an entry in A and m are constant.
更多查看译文
关键词
Integer programming,Restricted determinants,Linear programming
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络