505 search results - page 32 / 101 » FACETS |
DAM
2008
13 years 7 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
MP
2008
13 years 7 months ago
2008
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
IJCSA
2007
13 years 7 months ago
2007
This paper discusses different approaches for integrating biological knowledge in gene expression analysis. Indeed we are interested in the fifth step of microarray analysis pro...
ANOR
2005
13 years 7 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
COMBINATORICS
1999
13 years 7 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...