1274 search results - page 108 / 255 » N-fold integer programming |
114
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
129
click to vote
CC
2004
Springer
15 years 8 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
112
click to vote
DIS
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
134
click to vote
WAOA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
128
click to vote
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...