2 search results - page 1 / 1 » Optimal solutions for multi-unit combinatorial auctions: bra... |
141
Voted
SIGECOM
2000
ACM
15 years 10 months ago
2000
ACM
186
click to vote
JSAT
2010
15 years 21 days ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...