AbstractThis paper discusses five algorithms to solve linear integer programming problems that use the rational function techniques introduced by A. Barvinok. We report on the first ever experimental results based on these techniques
Many compiler optimization techniques depend on the ability to calculate the number of elements that...
We explore the computational complexity of computing pure Nash equilibria for a new class o...
AbstractA new algorithm is presented for finding the Frobenius rational form F∈Zn×nof any A∈Zn×nwhic...
This paper discusses five algorithms to solve linear integer programming problems that use the ratio...
AbstractThis paper discusses five algorithms to solve linear integer programming problems that use t...
Abstract. This paper presents algorithms for solving multiobjective integer programming problems. Th...
The main theme of this dissertation is the study of the lattice points in a rational convex...
We show that a 2-variable integer program, defined by m constraints involving coefficients with at m...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
An integer program (IP) is a problem of the form $\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \i...
Solution techniques for combinatorial optimization and integer programming problems are core discipl...
Abstract We describe the first implementation of the Barvinok–Woods (2003) algorithm, which computes...
We describe the first implementation of the Barvinok--Woods (2003) algorithm, which computes a sho...
This paper gives an algorithm for solving linear programming problems. For a problem with n constrai...
We review and describe several results regarding integer programming problems in fixed dimension. Fi...
Many compiler optimization techniques depend on the ability to calculate the number of elements that...
We explore the computational complexity of computing pure Nash equilibria for a new class o...
AbstractA new algorithm is presented for finding the Frobenius rational form F∈Zn×nof any A∈Zn×nwhic...
This paper discusses five algorithms to solve linear integer programming problems that use the ratio...
AbstractThis paper discusses five algorithms to solve linear integer programming problems that use t...
Abstract. This paper presents algorithms for solving multiobjective integer programming problems. Th...
The main theme of this dissertation is the study of the lattice points in a rational convex...
We show that a 2-variable integer program, defined by m constraints involving coefficients with at m...
AbstractThis paper discusses algorithms and software for the enumeration of all lattice points insid...
An integer program (IP) is a problem of the form $\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \i...
Solution techniques for combinatorial optimization and integer programming problems are core discipl...
Abstract We describe the first implementation of the Barvinok–Woods (2003) algorithm, which computes...
We describe the first implementation of the Barvinok--Woods (2003) algorithm, which computes a sho...
This paper gives an algorithm for solving linear programming problems. For a problem with n constrai...
We review and describe several results regarding integer programming problems in fixed dimension. Fi...
Many compiler optimization techniques depend on the ability to calculate the number of elements that...
We explore the computational complexity of computing pure Nash equilibria for a new class o...
AbstractA new algorithm is presented for finding the Frobenius rational form F∈Zn×nof any A∈Zn×nwhic...
DOI
Add to ORKG