Generating functions in the knapsack problem

DOI10.1134/S1064562418050198zbMATH Open1402.90152OpenAlexW2889645751MaRDI QIDQ1994094FDOQ1994094

Authors: V. K. Leont'ev, Eh. N. Gordeev 

Publication date: 1 November 2018

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562418050198

Recommendations

• On combinatorial properties of the knapsack problem
• scientific article; zbMATH DE number 3852791
• scientific article; zbMATH DE number 4160465
• scientific article; zbMATH DE number 2032368
• Average saving effects in enumerative methods for solving knapsack problems

zbMATH Keywords

generating functionsknapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions

Cited In (9)

• Title not available (Why is that?)
• Divisor generating functions and insertion into a heap
• On the Frobenius problem
• Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
• Title not available (Why is that?)
• On the number of solutions to a system of Boolean equations
• On combinatorial properties of the knapsack problem
• Combinatorial properties of the bounded knapsack problem
• On the number of solutions to linear Diophantine equation and Frobenius problem

This page was built for publication: Generating functions in the knapsack problem

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