Sciweavers

1332 search results - page 7 / 267
» Combinatorial Algorithms
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
STOC
2005
ACM
146views Algorithms» more  STOC 2005»
14 years 8 months ago
Approximation algorithms for combinatorial auctions with complement-free bidders
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Shahar Dobzinski, Noam Nisan, Michael Schapira
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm