Matrix analysis
Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Hi-index | 0.00 |
Let K=K"nxK"nx[0,1]@?R^2^n^+^1 where K"n is the standard simplex in R^n, i.e., K"n={x@?R"+^n:@?j=1nx"j=1}. We consider the set P@?R^2^n^+^1 given by P={(x,y,z)@?K:@?x-y@?"~=