The continuous knapsack problem with capacities

DOI10.1007/s40305-020-00298-6zbMath1488.90152OpenAlexW3025834519MaRDI QIDQ2059181

Tran Hoai Ngoc Nhan, Nguyen Chi Tam, Huynh Duc Quoc

Publication date: 13 December 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-020-00298-6

zbMATH Keywords

complexitycapacityknapsack problempolynomially solvable

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer optimization with penalized fractional values: the knapsack case
• Inverse median problems
• A model for the inverse 1-median problem on trees under uncertain costs
• Minimizing Sum of Truncated Convex Functions and Its Applications
• An Algorithm for Large Zero-One Knapsack Problems
• The Facility Location Problem with Limited Distances

This page was built for publication: The continuous knapsack problem with capacities