1182 search results - page 17 / 237 » Iterative Methods in Combinatorial Optimization |
AAAI
2004
15 years 1 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
PAMI
2000
14 years 11 months ago
2000
FS
2006
14 years 11 months ago
2006
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
114
click to vote
IJCAI
2001
15 years 1 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
IWANN
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...