A new complexity result on multiobjective linear integer programming using short rational generating functions

2011 ◽  
Vol 6 (3) ◽  
pp. 537-543 ◽  
Author(s):  
Víctor Blanco ◽  
Justo Puerto
Keyword(s):  
Integer Programming ◽  
Generating Functions ◽  
Linear Integer Programming ◽  
Complexity Result ◽  
Rational Generating Functions

scholarly journals Rational Generating Functions and Integer Programming Games

2011 ◽  
Vol 59 (6) ◽  
pp. 1445-1460 ◽  
Author(s):  
Matthias Köppe ◽  
Christopher Thomas Ryan ◽  
Maurice Queyranne
Keyword(s):  
Integer Programming ◽  
Generating Functions ◽  
Rational Generating Functions

scholarly journals Counting with rational generating functions

2008 ◽  
Vol 43 (2) ◽  
pp. 75-91 ◽  
Author(s):  
Sven Verdoolaege ◽  
Kevin Woods
Keyword(s):  
Generating Functions ◽  
Rational Generating Functions

Linear Integer Programming

2021 ◽  
Author(s):  
Elias Munapo ◽  
Santosh Kumar
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming

scholarly journals An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets

2020 ◽  
Vol 282 (2) ◽  
pp. 453-463
Author(s):  
María Isabel Hartillo-Hermoso ◽  
Haydee Jiménez-Tafur ◽  
José María Ucha-Enríquez
Keyword(s):  
Integer Programming ◽  
Linear Integer Programming ◽  
Test Sets ◽  
Constraint Method

scholarly journals PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS

2015 ◽  
Vol 80 (2) ◽  
pp. 433-449 ◽  
Author(s):  
KEVIN WOODS
Keyword(s):  
Generating Functions ◽  
Counting Function ◽  
Order Theory ◽  
Characteristic Functions ◽  
Presburger Arithmetic ◽  
First Order ◽  
First Order Theory ◽  
Rational Generating Function ◽  
Rational Generating Functions

AbstractPresburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be represented by rational generating functions; a geometric characterization of such sets is also given. In addition, ifp= (p1, . . . ,pn) are a subset of the free variables in a Presburger formula, we can define a counting functiong(p) to be the number of solutions to the formula, for a givenp. We show that every counting function obtained in this way may be represented as, equivalently, either a piecewise quasi-polynomial or a rational generating function. Finally, we translate known computational complexity results into this setting and discuss open directions.

scholarly journals Smart Health Model With A Linear Integer Programming Approach

2019 ◽  
Vol 1361 ◽  
pp. 012069 ◽  
Author(s):  
A M H Pardede ◽  
H Mawengkang ◽  
M Zarlis ◽  
T Tulus ◽  
L A N Kadim ◽  
...  
Keyword(s):  
Integer Programming ◽  
Programming Approach ◽  
Linear Integer Programming ◽  
Smart Health ◽  
Health Model
Sign in / Sign up

Export Citation Format

Share Document