Sciweavers

MP
2010
80views more  MP 2010»
13 years 6 months ago
Mixing MIR inequalities with two divisible coefficients
Miguel Constantino, Andrew J. Miller, Mathieu Van ...
MP
2010
150views more  MP 2010»
13 years 6 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
MP
2010
132views more  MP 2010»
13 years 6 months ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov
MP
2010
97views more  MP 2010»
13 years 6 months ago
Semidefinite representation of convex sets
Let S = {x Rn : g1(x) 0,
J. William Helton, Jiawang Nie
MP
2010
92views more  MP 2010»
13 years 6 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
MOR
2010
79views more  MOR 2010»
13 years 6 months ago
Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides
Bernard De Meyer, Ehud Lehrer, Dinah Rosenberg
MOR
2010
79views more  MOR 2010»
13 years 6 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz