×
验证码:
换一张
Forgotten Password?
Stay signed in
China Science and Technology Network Pass Registration
×
China Science and Technology Network Pass Registration
Log In
Chinese
|
English
中国科学院数学与系统科学研究院机构知识库
KMS Of Academy of mathematics and systems sciences, CAS
Log In
Register
ALL
ORCID
Title
Creator
Date Issued
Subject Area
Keyword
Document Type
Source Publication
Date Accessioned
Indexed By
Publisher
Funding Project
MOST Discipline Catalogue
Study Hall
Image search
Paste the image URL
Home
Collections
Authors
DocType
Subjects
K-Map
News
Search in the results
Collection
Authors
Document Type
Journal ar... [2]
Date Issued
2022 [1]
2020 [1]
Language
英语 [2]
Source Publication
JOURNAL OF... [1]
SCIENCE CH... [1]
Funding Project
Beijing In... [1]
Chinese NS... [1]
Chinese NS... [1]
Chinese NS... [1]
Chinese NS... [1]
Chinese NS... [1]
More...
Indexed By
SCI [2]
Funding Organization
×
Knowledge Map
CSpace
Start a Submission
Submissions
Unclaimed
Claimed
Attach Fulltext
Bookmarks
QQ
Weibo
Feedback
Browse/Search Results:
1-2 of 2
Help
Selected(
0
)
Clear
Items/Page:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Sort:
Select
Issue Date Ascending
Issue Date Descending
Journal Impact Factor Ascending
Journal Impact Factor Descending
Title Ascending
Title Descending
Author Ascending
Author Descending
WOS Cited Times Ascending
WOS Cited Times Descending
Submit date Ascending
Submit date Descending
Lifting for the integer knapsack cover polyhedron
期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 45
Authors:
Chen, Wei-Kun
;
Chen, Liang
;
Dai, Yu-Hong
Favorite
|
View/Download：38/0
|
Submit date：2023/02/07
Integer programming
Cutting plane
Sequential lifting
MIR inequality
Separation algorithm
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
Authors:
Chen, Wei-Kun
;
Dai, Yu-Hong
Favorite
|
View/Download：97/0
|
Submit date：2020/05/24
integer programming
sequentially lifted cover inequality
complexity
lifting problem
