Heuristic and reduction algorithms for the knapsack sharing problem
type: Item
instance of: scholarly article
title: Heuristic and reduction algorithms for the knapsack sharing problem
zbMATH Open document ID: 0893.90133
DOI: 10.1016/S0305-0548(97)00009-9
author: Takeo Yamada
author: Mayumi Futakawa
published in: Computers \& Operations Research
publication date: 1997-09-17T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1061795
zbMATH Keywords: knapsack sharing
zbMATH Keywords: NP-hard
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: The Knapsack Sharing Problem
cites work: Reduction Algorithm for Zero-One Single Knapsack Problems
cites work: On Marginal Allocation in Single Constraint Min-Max Problems
cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
cites work: A linear-time algorithm for solving continuous maximin knapsack problems
cites work: Minimax resource allocation problems: Optimization and parametric analysis
cites work: Q3993418
cites work: More on Min-Max Allocation
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
description: scientific article; zbMATH DE number 1061795