ORL
8 years 5 months ago
2016
It is well-known that the intersection of the matching polytope with a cardinality constraint is integral [8]. We prove a similar result for the polytope corresponding to the tran...
ORL
8 years 5 months ago
2016
The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the ite...
ORL
8 years 5 months ago
2016
We consider the linear or quadratic 0/1 program P : f∗ = min{cT x + xT Fx : A x = b; x ∈ {0, 1}n }, for some vectors c ∈ Rn , b ∈ Zm , some matrix A ∈ Zm×n and some real...
ORL
8 years 5 months ago
2016
The minimum rank problem asks to find the minimum rank over all matrices with given pattern associated with a graph. This problem is NP-hard, and there is no known approximation ...
ORL
8 years 5 months ago
2016
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced by an arbitrary digraph prescribing the dominance relation among the players, is...
|