Threshold arrangements and the knapsack problem

DOI10.1016/j.aml.2005.03.010zbMath1093.90049OpenAlexW2074117568MaRDI QIDQ812753

Günter Rote, André Schulz

Publication date: 24 January 2006

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2005.03.010

zbMATH Keywords

Knapsack problemthreshold graphsreal number model

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the multiple knapsack problem
• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• Threshold graphs and related topics

This page was built for publication: Threshold arrangements and the knapsack problem