咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献

馆藏范围

  • 2 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 2 篇 lifting problem
  • 1 篇 buchstaber invar...
  • 1 篇 integer programm...
  • 1 篇 sequentially lif...
  • 1 篇 complexity
  • 1 篇 universal comple...

机构

  • 1 篇 school of mathem...
  • 1 篇 lsec icmsec acad...
  • 1 篇 school of mathem...
  • 1 篇 school of mathem...

作者

  • 1 篇 wei-kun chen
  • 1 篇 yi sun
  • 1 篇 yu-hong dai

语言

  • 2 篇 英文
检索条件"主题词=lifting problem"
2 条 记 录,以下是1-10 订阅
排序:
Buchstaber Invariants of Universal Complexes
收藏 引用
Chinese Annals of Mathematics,Series B 2017年 第6期38卷 1335-1344页
作者: Yi SUN School of Mathematical Sciences Fudan UniversityShanghai 200433China.
Davis and Januszkiewicz introduced(real and complex) universal complexes to give an equivalent definition of characteristic maps of simple polytopes, which now can be seen as "colorings". The author derives an equival... 详细信息
来源: 维普期刊数据库 维普期刊数据库 同方期刊数据库 同方期刊数据库 评论
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
收藏 引用
Science China Mathematics 2021年 第1期64卷 211-220页
作者: Wei-Kun Chen Yu-Hong Dai School of Mathematics and Statistics Beijing Institute of TechnologyBeijing100081China LSEC ICMSECAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing100049China
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer ***,it is still an open question whether a sequentially lifted cover inequality can be computed in polynomial time for a ... 详细信息
来源: 维普期刊数据库 维普期刊数据库 同方期刊数据库 同方期刊数据库 评论