270 search results - page 6 / 54 » Constraint relaxation in approximate linear programs |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
TCS
2008
14 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
85
Voted
ACL
2009
14 years 7 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
147
Voted
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
96
Voted
MP
2007
14 years 9 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...