Next:
MINIMUM COVERING INTEGER PROGRAMMING
Up:
Mathematical Programming
Previous:
MAXIMUM BOUNDED 0-1 PROGRAMMING
 
Index
M
AXIMUM
P
ACKING
I
NTEGER
P
ROGRAMMING
I
NSTANCE:
Rational
-matrix
, rational
m
-vector
, rational
n
-vector
.
S
OLUTION:
A rational
n
-vector
such that
.
M
EASURE:
The scalar product of
c
and
x
, i.e.,
.
Good News:
Approximable within
for some
c>0
, where
[
446
].
Comment:
Variation in which
and
is approximable within
[
446
].
Viggo Kann
2000-03-20