1776 search results - page 196 / 356 » Uncertain Linear Constraints |
172
click to vote
MP
2007
15 years 6 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...
168
click to vote
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...
185
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 ...
210
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...
167
click to vote
TSP
2010
15 years 1 months 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...