270 search results - page 22 / 54 » Constraint relaxation in approximate linear programs |
164
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
158
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
133
click to vote
ALGORITHMICA
1999
15 years 3 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
131
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
155
click to vote
ENDM
2010
15 years 4 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...