Threshold arrangements and the knapsack problem

DOI10.1016/J.AML.2005.03.010MaRDI QIDQ812753zbMATH OpenOpenAlexFDO

Authors 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 problemreal number modelthreshold graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On combinatorial properties of the knapsack problem
• scientific article; zbMATH DE number 3999287
• A graph theoretic approach to solve special knapsack problems in polynomial time
• Counting and enumerating independent sets with applications to combinatorial optimization problems
• scientific article; zbMATH DE number 4005976

Cites work

• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• Heuristic algorithms for the multiple knapsack problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• Threshold graphs and related topics

Cited in

(3)

• Bin-packing and matchings in threshold graphs
• A graph theoretic approach to solve special knapsack problems in polynomial time
• scientific article; zbMATH DE number 3999287 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812753)