200
click to vote
ORL
2016
10 years 21 days ago
2016
We consider the problem of solving multiple “coupled” root-finding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic ...
208
click to vote
ORL
2016
10 years 21 days 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...
177
click to vote
ORL
2016
10 years 21 days 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 ...
178
click to vote
ORL
2016
10 years 21 days ago
2016
We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate secon...
169
click to vote
ORL
2016
10 years 21 days ago
2016
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show tha...