2652 search results - page 83 / 531 » Privacy-preserving linear programming |
MP
2006
14 years 11 months ago
2006
We introduce strong formulations for robust mixed 0
ICALP
1997
Springer
15 years 4 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
180
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
112
click to vote
PPDP
2004
Springer
15 years 5 months ago
2004
Springer
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
COR
2006
14 years 12 months ago
2006
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...