Update search
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
NARROW
Format
Journal
Type
Date
Availability
1-2 of 2
Keywords: Combinatorial optimization
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Journal:
Data Technologies and Applications
Data Technologies and Applications (2025) 59 (2): 362–392.
Published: 12 February 2025
...Ruizhi Li; Fangzhou Wang; Siqi Liu; Ruiqi Xu; Minghao Yin; Shuli Hu Purpose Maximum k vertex cover problem is a significant combinatorial optimization problem with various applications, such as transportation planning, social networks and sensor placement. Up to now, no practical...
Journal Articles
Journal:
Data Technologies and Applications
Data Technologies and Applications (2021) 55 (2): 233–250.
Published: 01 December 2020
...Yupeng Zhou; Mengyu Zhao; Mingjie Fan; Yiyuan Wang; Jianan Wang Purpose The set-union knapsack problem is one of the most significant generalizations of the Non-deterministic Polynomial (NP)-hard 0-1 knapsack problem in combinatorial optimization, which has rich application scenarios. Although...
