scientific article; zbMATH DE number 808811

MaRDI QIDQ4852860zbMATH OpenFDO

Authors N. N. Kuzyurin

Publication date 17 March 1996

zbMATH Keywords

multidimensional knapsack problempolynomial-time algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An algorithm that is polynomial on the average in integer linear programming
• scientific article; zbMATH DE number 6007902
• scientific article; zbMATH DE number 3852791
• Probabilistic Analysis of the Multidimensional Knapsack Problem
• Random knapsack in expected polynomial time

Cited in

(8)

• An algorithm that is polynomial on the average in integer linear programming
• Average number of iterations of some polynomial interior-point -- algorithms for linear programming
• Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
• Estimation of the number of iterations in integer programming algorithms using the regular partitions method
• An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
• Generalization of the subset sum problem and cubic forms
• Effective lower bounds on the matrix rank and their applications
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

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 Q4852860)