A New Algebraic Geometry Algorithm for Integer Programming
提出一种基于代数几何思想的整数规划新算法，能自然推广Farkas引理、进行灵敏度分析、系统枚举所有可行解，并揭示可行集的结构信息。
We propose a new algorithm for solving integer programming (IP) problems that is based on ideas from algebraic geometry. The method provides a natural generalization of the Farkas lemma for IP, leads to a way of performing sensitivity analysis, offers a systematic enumeration of all feasible solutions, and gives structural information of the feasible set of a given IP. We provide several examples that offer insights on the algorithm and its properties.