Solving knapsack sharing problems with general tradeoff functions

DOI10.1007/BF01586926zbMATH Open0733.90064OpenAlexW2070437690MaRDI QIDQ810377FDOQ810377

Authors J. Randall Brown

Publication date 1991

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

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

zbMATH Keywords

optimality conditionsstaircase functionsascending functioncontinuous tradeoff functionknapsack sharing problemmaximin programmingminimax mathematical programmingmultiple-valued objective functionsPolynomial algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Optimality conditions for minimax problems (49K35)

Recommendations

• Bounded knapsack sharing
• DP-based algorithm and FPTAS for the knapsack sharing and related problems
• Minmax linear knapsack problem with grouped variables and gub
• Linear and combinatorial sharing problems
• The Linear Sharing Problem

Cites work

• scientific article; zbMATH DE number 3298941 (Why is no real title available?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• A Stochastic Allocation Problem
• A graphical method to solve a maximin allocation problem
• An algorithm for separable nonlinear minimax problems
• Continuous maximin knapsack problems with GLB constraints
• Equalization of Runout Times
• Max-min resource allocation
• More on Min-Max Allocation
• On Marginal Allocation in Single Constraint Min-Max Problems
• Optimal storage allocation for serial files
• Resource allocation among competing activities: A lexicographic minimax approach
• Stochastic Allocation Rules
• Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
• Technical Note—On Min-Max Integer Allocation Problems
• The Knapsack Sharing Problem
• The Linear Sharing Problem
• The Sharing Problem
• The flow circulation sharing problem

Cited in

(17)

• Cooperative and axiomatic approaches to the knapsack allocation problem
• Solving knapsack problems with \(S\)-curve return functions
• Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• New upper bounds and exact methods for the knapsack sharing problem
• A lexicographic minimax algorithm for multiperiod resource allocation
• An exact algorithm for the knapsack sharing problem
• The Linear Sharing Problem
• Linear and combinatorial sharing problems
• Knapsack cost sharing
• Sharing problems
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• A nonlinear minimax allocation problem with multiple knapsack constraints
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
• Bounded knapsack sharing
• Minimax resource allocation problems: Optimization and parametric analysis
• scientific article; zbMATH DE number 936866 (Why is no real title available?)

This page was built for publication: Solving knapsack sharing problems with general tradeoff functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810377)