scientific article; zbMATH DE number 2059840

MaRDI QIDQ4458134zbMATH OpenFDO

Authors Isto Aho

Publication date 17 March 2004

Full work available at URL http://iospress.metapress.com/app/home/contribution.asp?referrer=parent&backto=issue,1,10

zbMATH Keywords

knapsack-type problemsconstrained longest pathspolynomial-time subclasses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A new fully polynomial time approximation scheme for the Knapsack problem
• scientific article; zbMATH DE number 1182767
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• A new approximation algorithm for the knapsack problem
• scientific article; zbMATH DE number 3876925
• A pseudo-polynomial time algorithm for solving the knapsack problem in polynomial space
• New trends in exact algorithms for the \(0-1\) knapsack problem
• New generic algorithms for hard knapsacks
• A new class of hard problem instances for the 0-1 knapsack problem
• scientific article; zbMATH DE number 4093181

Cited in

(3)

• scientific article; zbMATH DE number 7401920 (Why is no real title available?)
• scientific article; zbMATH DE number 1182767 (Why is no real title available?)
• scientific article; zbMATH DE number 1546499 (Why is no real title available?)

This page was built for publication:

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