Ideal polytopes and face structures of some combinatorial optimization problems

被引：0
|
作者：
Tokyo inst. technology, dep. information sci., Meguro-ku, Tokyo 152, Japan [1 ]
机构：
来源：
Math Program Ser B | / 1卷 / 1-15期
关键词：
Number:; -; Acronym: [!text type='JS']JS[!/text]PS; Sponsor: Japan Society for the Promotion of Science;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 6 条
  • [1] Search-space smoothing for combinatorial optimization problems
    Schneider, Johannes
    Dankesreiter, Markus
    Fettes, Werner
    Morgenstern, Ingo
    Schmid, Martin
    Singer, Johannes Maria
    Physica A: Statistical Mechanics and its Applications, 1997, 243 (1-2): : 77 - 112
  • [2] Some Combinatorial Problems in Power-Law Graphs
    Jiang, Che
    Xu, Wanyue
    Zhou, Xiaotian
    Zhang, Zhongzhi
    Kan, Haibin
    COMPUTER JOURNAL, 2022, 65 (07): : 1679 - 1691
  • [3] Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems
    Takabe, Satoshi
    Hukushima, Koji
    PHYSICAL REVIEW E, 2016, 93 (05)
  • [4] Deep memetic models for combinatorial optimization problems: application to the tool switching problem
    Edgar Amaya, Jhon
    Cotta, Carlos
    Fernandez-Leiva, Antonio J.
    Garcia-Sanchez, Pablo
    MEMETIC COMPUTING, 2020, 12 (01) : 3 - 22
  • [5] On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
    Jiang, Minghui
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 125 - 137
  • [6] On the parameterized complexity of some optimization problems related to multiple-interval graphs
    Jiang, Minghui
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (49) : 4253 - 4262
1