Exact algorithms for the matrix bid auction
From MaRDI portal
Publication:958442
DOI10.1016/j.cor.2007.12.009zbMath1162.91356OpenAlexW2158392842MaRDI QIDQ958442
Frits C. R. Spieksma, Dries R. Goossens
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/120979
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (2)
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ Exact methods for combinatorial auctions. (Abstract of Thesis)
Uses Software
Cites Work
- Unnamed Item
- Exact algorithms for procurement problems under a total quantity discount structure
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Exact methods for combinatorial auctions. (Abstract of Thesis)
- The hardness of approximation: Gap location
- An exact algorithm for IP column generation
- Tractable combinatorial auctions and \(b\)-matching
- Computationally Manageable Combinational Auctions
- Combinatorial Auctions: A Survey
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Decomposition Principle for Linear Programs
- Experimental and Efficient Algorithms
- Algorithm for optimal winner determination in combinatorial auctions
This page was built for publication: Exact algorithms for the matrix bid auction