1776 search results - page 196 / 356 » Uncertain Linear Constraints |
166
Voted
MP
2007
15 years 5 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
159
Voted
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
179
click to vote
COCOA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
204
click to vote
MP
2011
15 years 1 months ago
2011
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very e...
160
click to vote
TSP
2010
15 years 25 days ago
2010
In this paper, the achievable rates of the so called "multiple-input multiple-output interference channel", exploited by a couple of single antenna primary terminals and...