Abstract
The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint places an upper bound on the sum of the non-negative variables. We develop efficient algorithms for piecewise linear, nonlinear, and piecewise nonlinear tradeoff functions and for any knapsack sharing problem with integer variables. These algorithms for the knapsack sharing problem extend the sharing problem algorithm in a companion paper to any piecewise linear, nonlinear, or piecewise nonlinear tradeoff functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
