3250 search results - page 122 / 650 » An Algorithm to Solve a Linear Program |
110
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
116
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
127
Voted
SAGT
2010
Springer
15 years 1 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...
142
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
140
Voted
EC
2000
15 years 2 months ago
2000
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...