Heuristic and reduction algorithms for the knapsack sharing problem

DOI10.1016/S0305-0548(97)00009-9zbMath0893.90133MaRDI QIDQ1366711

Mayumi Futakawa, Takeo Yamada

Publication date: 17 September 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

NP-hardheuristicknapsack sharing

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ New upper bounds and exact methods for the knapsack sharing problem ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ An exact algorithm for the knapsack sharing problem ⋮ An exact algorithm for the knapsack sharing problem with common items

Cites Work

• Unnamed Item
• Minimax resource allocation problems: Optimization and parametric analysis
• A linear-time algorithm for solving continuous maximin knapsack problems
• A Max-Min Allocation Problem: Its Solutions and Applications
• Reduction Algorithm for Zero-One Single Knapsack Problems
• The Knapsack Sharing Problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• On Marginal Allocation in Single Constraint Min-Max Problems
• More on Min-Max Allocation