270 search results - page 30 / 54 » Constraint relaxation in approximate linear programs |
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
COR
2010
15 years 16 days ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
105
click to vote
CORR
2008
Springer
15 years 16 days ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
91
Voted
ATMOS
2007
15 years 2 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
112
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...