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
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [2] Ideal polytopes and face structures of some combinatorial optimization problems
    Ikebe, YT
    Tamura, A
    MATHEMATICAL PROGRAMMING, 1995, 71 (01) : 1 - 15
  • [3] Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
    Maksimenko A.N.
    Journal of Applied and Industrial Mathematics, 2016, 10 (3) : 370 - 379
  • [4] COMBINATORIAL FACE ENUMERATION IN CONVEX POLYTOPES
    FUKUDA, K
    ROSTA, V
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1994, 4 (04): : 191 - 198
  • [5] ON THE CIRCUIT DIAMETER OF SOME COMBINATORIAL POLYTOPES
    Kafer, Sean
    Pashkovich, Kanstantsin
    Sanita, Laura
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (01) : 1 - 25
  • [6] Compensatory operators in some combinatorial optimization problems
    Stajner-Papuga, Ivana
    Takaci, Aleksandar
    IEEE 13TH INTERNATIONAL SYMPOSIUM ON INTELLIGENT SYSTEMS AND INFORMATICS (SISY), 2015, : 107 - 110
  • [7] Exponential Lower Bounds for Polytopes in Combinatorial Optimization
    Fiorini, Samuel
    Massar, Serge
    Pokutta, Sebastian
    Tiwary, Hans Raj
    De Wolf, Ronald
    JOURNAL OF THE ACM, 2015, 62 (02)
  • [8] Solution Structure of Some Inverse Combinatorial Optimization Problems
    Department of Mathematics, City University of Hong Kong, Hong Kong, Hong Kong
    不详
    J Combin Optim, 1 (127-139):
  • [9] Partial enumeration in heuristics for some combinatorial optimization problems
    Volgenant, A.
    Zwiers, I. Y.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (01) : 73 - 79
  • [10] Differential approximation algorithms for some combinatorial optimization problems
    Demange, M
    Grisoni, P
    Paschos, VT
    THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) : 107 - 122