Some extended knapsack problems involving job partition between two parties

DOI10.1007/S11766-007-0314-2zbMath1150.91001OpenAlexW2078854059MaRDI QIDQ933034

Yanhong Gu, Quanle Chen

Publication date: 6 August 2008

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-007-0314-2

zbMATH Keywords

knapsack problemprofit allocationjob partition

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial optimization (90C27)

Cites Work

• A note on repeated-offers bargaining with one-sided incomplete information
• Fast Approximation Algorithms for Knapsack Problems

This page was built for publication: Some extended knapsack problems involving job partition between two parties