Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
From MaRDI portal
Publication:5459144
DOI10.1007/11940128_50zbMath1135.90394OpenAlexW1568183365MaRDI QIDQ5459144
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_50
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (1)
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Uses Software
This page was built for publication: Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems