Abstract
Let be a partition of be a partition of Si and ci and aj are scalars for We consider the problem MinimiseMaximum Subject to An algorithm is proposed to solve this problem. We also obtain a linear tune algorithm to solve the knapsack sharing problem with piece-wise linear trade-off functions which improves its existing time bound. As a by-product of this result, we have an O(n) algorithm to solve the continuous minmax knapsack problem with GLB constraints which improves the existing time bound
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.
