3250 search results - page 172 / 650 » An Algorithm to Solve a Linear Program |
178
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
124
click to vote
PAMI
2006
15 years 6 months ago
2006
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
150
click to vote
DAM
2010
15 years 6 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
162
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
144
click to vote
ACSC
2007
IEEE
16 years 20 days ago
2007
IEEE
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...