THE COMPLEXITY OF VERTEX ENUMERATION METHODS

被引:98
|
作者
DYER, ME
机构
关键词
D O I
10.1287/moor.8.3.381
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
44
引用
收藏
页码:381 / 402
页数:22
相关论文
共 50 条
  • [21] The Complexity of Approximating Vertex Expansion
    Louis, Anand
    Raghavendra, Prasad
    Vempala, Santosh
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 360 - 369
  • [22] Parameterized complexity of vertex colouring
    Cai, LZ
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (03) : 415 - 429
  • [23] Computational experience with the reverse search vertex enumeration algorithm
    Avis, David
    Optimization Methods and Software, 10 (02): : 107 - 124
  • [24] The enumeration of vertex induced subgraphs with respect to the number of components
    Tittmann, P.
    Averbouch, I.
    Makowsky, J. A.
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (07) : 954 - 974
  • [25] A revised implementation of the reverse search vertex enumeration algorithm
    Avis, D
    POLYTOPES - COMBINATORICS AND COMPUTATION, 2000, 29 : 177 - 198
  • [26] Robust vertex enumeration for convex hulls in high dimensions
    Pranjal Awasthi
    Bahman Kalantari
    Yikai Zhang
    Annals of Operations Research, 2020, 295 : 37 - 73
  • [27] Robust vertex enumeration for convex hulls in high dimensions
    Awasthi, Pranjal
    Kalantari, Bahman
    Zhang, Yikai
    ANNALS OF OPERATIONS RESEARCH, 2020, 295 (01) : 37 - 73
  • [28] Computational experience with the reverse search vertex enumeration algorithm
    Avis, D
    OPTIMIZATION METHODS & SOFTWARE, 1998, 10 (02): : 107 - 124
  • [29] Robust Vertex Enumeration for Convex Hulls in High Dimensions
    Awasthi, Pranjal
    Kalantari, Bahman
    Zhang, Yikai
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 84, 2018, 84
  • [30] mplrs: A scalable parallel vertex/facet enumeration code
    Avis D.
    Jordan C.
    Mathematical Programming Computation, 2018, 10 (2) : 267 - 302