An exact algorithm for the knapsack sharing problem with common items
type: Item
instance of: scholarly article
title: An exact algorithm for the knapsack sharing problem with common items
zbMATH Open document ID: 1090.90162
author: Masako Fujimoto
author: Takeo Yamada
published in: European Journal of Operational Research
publication date: 2006-03-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5012933
zbMATH Keywords: combinational optimization
zbMATH Keywords: Knapsack problem
zbMATH Keywords: Knapsack sharing
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.09.036
OpenAlex ID: W1984555447
cites work: The Knapsack Sharing Problem
cites work: Bounded knapsack sharing
cites work: Minimax and applications
cites work: Q4198056
cites work: The knapsack sharing problem: an exact algorithm
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
cites work: Q4821303
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: Discrete Dynamic Programming and Capital Allocation
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
cites work: Heuristic and reduction algorithms for the knapsack sharing problem
cites work: A branch-and-bound algorithm for the mini-max spanning forest problem
DOI: 10.1016/J.EJOR.2004.09.036
description: scientific article; zbMATH DE number 5012933