Computing and Combinatorics
From MaRDI portal
Publication:5716982
DOI10.1007/11533719zbMath1128.91321MaRDI QIDQ5716982
Anshul Kothari, Yunhong Zhou, Subhash Suri
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
90C10: Integer programming
91B26: Auctions, bargaining, bidding and selling, and other market models
Related Items
Learning-augmented algorithms for online subset sum, Subset sum problems with digraph constraints, A new fully polynomial time approximation scheme for the interval subset sum problem, Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Uses Software