Definition of the narrow intervals for variables in the integer-valued knapsack problem

MaRDI QIDQ5393244zbMATH OpenFDO

Authors Knyaz Sh. Mamedov

Publication date 16 April 2011

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Recommendations

• On the approximation of an optimal solution to the integer knapsack problem by optimal solutions to the integer knapsack problem with a restriction on the cardinality
• scientific article; zbMATH DE number 4160465
• Integrality gaps of integer knapsack problems
• scientific article; zbMATH DE number 3852791
• A solution method for a knapsack problem and its variant

Cited in

(1)

• A priori determination of bounds for the optimal value of variables in integer linear programming problems

This page was built for publication: Definition of the narrow intervals for variables in the integer-valued knapsack problem

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