2652 search results - page 20 / 531 » Privacy-preserving linear programming |
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
CISS
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
EUROGP
2003
Springer
15 years 2 months ago
2003
Springer
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
75
Voted
EOR
2006
14 years 9 months ago
2006
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
76
Voted
ECCC
2007
14 years 9 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...