Bounded knapsack sharing

DOI10.1007/BF01582227zbMath0821.90098OpenAlexW2127568650MaRDI QIDQ1804651

J. Randall Brown

Publication date: 15 May 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582227

zbMATH Keywords

lower and upper boundsmultiple constraintsmaximin programmingbounded knapsack sharing problempiecewise linear tradeoff functionspreprocessor procedure

Mathematics Subject Classification ID

Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35)

Related Items

Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints ⋮ An equitable bandwidth allocation model for video-on-demand networks ⋮ An exact algorithm for the knapsack sharing problem with common items

Cites Work

• Solving knapsack sharing problems with general tradeoff functions
• Resource allocation among competing activities: A lexicographic minimax approach
• An algorithm for separable nonlinear minimax problems
• A nonlinear minimax allocation problem with multiple knapsack constraints
• A lexicographic minimax algorithm for multiperiod resource allocation
• The Linear Sharing Problem
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• The Knapsack Sharing Problem
• Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs