On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint

DOI10.1007/978-3-030-58657-7_2zbMath1460.90148arXiv2004.08589OpenAlexW3135330276MaRDI QIDQ4965095

A. Y. Chirkov, Nikolai Yu. Zolotykh, Dmitriy V. Gribanov

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08589

zbMATH Keywords

approximate solutioncardinality constraintsmulti-dimensional knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A total-value greedy heuristic for the integer knapsack problem
• Joint performance of greedy heuristics for the integer knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints

This page was built for publication: On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint