When two-constraint binary knapsack problem is equivalent to classical knapsack problem?

DOI10.1007/978-3-030-77716-6_27zbMath1502.90156OpenAlexW3192238769MaRDI QIDQ2080121

Krzysztof Szkatuła

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77716-6_27

zbMATH Keywords

combinatorial optimizationprobabilistic analysisLagrange functionknapsack problemsconstraints activity

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic analysis of the multiknapsack value function
• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
• The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem

This page was built for publication: When two-constraint binary knapsack problem is equivalent to classical knapsack problem?