ADJACENT VERTICES OF THE ALL 0-1 PROGRAMMING POLYTOPE

被引：0
|
作者：
BALAS, E [1 ]
PADBERG, MW [1 ]
机构：
[1] NYU, NEW YORK, NY 10003 USA
来源：
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1979年 / 13卷 / 01期
关键词：
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：3 / 12
页数：10
相关论文
共 50 条
  • [1] Construction of facets for the 0-1 quadratic knapsack polytope
    Faye, A
    Boyer, O
    RAIRO-OPERATIONS RESEARCH, 2003, 37 (04): : 249 - 271
  • [2] Consistency for 0-1 Programming
    Davarnia, Danial
    Hooker, J. N.
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2019, 2019, 11494 : 225 - 240
  • [3] ADJACENCY OF TRAVELING SALESMAN TOURS AND 0-1 VERTICES
    RAO, MR
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1976, 30 (02) : 191 - 198
  • [4] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM
    GLOVER, F
    WOOLSEY, E
    OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182
  • [5] Fractional 0-1 programming and submodularity
    Han, Shaoning
    Gomez, Andres
    Prokopyev, Oleg A.
    JOURNAL OF GLOBAL OPTIMIZATION, 2022, 84 (01) : 77 - 93
  • [6] 0-1 OPTIMIZATION AND NONLINEAR PROGRAMMING
    ROSENBERG, IG
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1972, 6 (12): : 95 - 97
  • [7] EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING
    BARAHONA, F
    JUNGER, M
    REINELT, G
    MATHEMATICAL PROGRAMMING, 1989, 44 (02) : 127 - 137
  • [8] Persistency in 0-1 polynomial programming
    Adams, WP
    Lassiter, JB
    Sherali, HD
    MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (02) : 359 - 389
  • [9] A NEW ALGORITHM TO FIND ALL VERTICES OF A POLYTOPE
    KHANG, DB
    FUJIWARA, O
    OPERATIONS RESEARCH LETTERS, 1989, 8 (05) : 261 - 264
  • [10] The 0-1 Knapsack Polytope - A Starting Point for Cryptanalysis of Knapsack Ciphers?
    Mak-Hau, Vicky H.
    Batten, Lynn M.
    APPLICATIONS AND TECHNIQUES IN INFORMATION SECURITY, ATIS 2014, 2014, 490 : 171 - 182
12345