Multi-scale quantum resonance solving algorithm for multi-choice multi-dimensional knapsack problem
A knapsack problem and multi-scale technology, applied in the field of operations research, can solve problems that cannot be directly applied and take a long time
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0065] The present invention will be further described below in conjunction with accompanying drawing:
[0066] The knapsack problem is a combinatorial optimization problem proposed by Merkel and Hellman. Among its extended problems, MMKP is the most difficult problem to solve. It is built on the multi-choice knapsack problem and multidimensional knapsack problem, which can be described as follows:
[0067] There are some items with different benefits that need to be put into the backpack. These items are divided into mutually exclusive groups, and each item selected needs to consume one or more resources. The purpose of MMKP is to select from each group and only An item can be selected so that the total income of the selected item is maximized, and the consumption of each resource does not exceed a given upper limit (knapsack constraint).
[0068] If there are n mutually exclusive groups G={G 1 ,G 2 ,...,G n}, G i ∩G j =φ, 1≤i≠j≤n, I={1,2,…,n} is the group index set, g ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com