Computing and Combinatorics

DOI10.1007/11533719zbMath1128.91321OpenAlexW4376561447MaRDI 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

Mathematics Subject Classification ID

Integer programming (90C10) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (4)

Subset sum problems with digraph constraints ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A new fully polynomial time approximation scheme for the interval subset sum problem ⋮ Learning-augmented algorithms for online subset sum

Uses Software

• Knapsack

This page was built for publication: Computing and Combinatorics