15 search results - page 1 / 3 » A MAX-CUT formulation of 0 1 programs |
ORL
2008
13 years 4 months ago
2008
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
ESOP
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
12 years 11 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
ISCAS
1994
IEEE
13 years 8 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
IPL
2010
13 years 3 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...