Abstract
The Matroidal Knapsack Problem (MK) consists in finding the maximum weight basis for a given matroid subject to a knapsack constraint. Special cases of this problem are the Multiple Choice Knapsack and the Capacitated Minimal Spanning Tree Problems. Using matroidal relaxations for knapsack problems we build a relaxation for MK. This relaxation produces an upper bound on MK dominating the usual LP-bound and computable using a polynomial number of calls to the greedy algorithm for the matroid.
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.
