ORL

2016

8 years 7 months ago
2016

We consider the problem of solving multiple “coupled” root-ﬁnding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic ...

ORL

2016

8 years 7 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

2016

8 years 7 months ago
2016

The minimum rank problem asks to ﬁnd 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

2016

8 years 7 months 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...

ORL

2016

8 years 7 months 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...

ORL

2016

8 years 7 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...

ORL

2016

8 years 7 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

2016

8 years 7 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...

ORDER

2016

8 years 7 months ago
2016

We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalenc...

ORDER

2016

8 years 7 months ago
2016

Dorais asked for the maximum guaranteed size of a dimension d subposet of an n-element poset. A lower bound of order √ n was found by Goodwillie. We provide a sublinear upper bou...