共 50 条
- [1] Construction of facets for the 0-1 quadratic knapsack polytope [J]. RAIRO-OPERATIONS RESEARCH, 2003, 37 (04): : 249 - 271
- [2] Consistency for 0-1 Programming [J]. INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2019, 2019, 11494 : 225 - 240
- [6] 0-1 OPTIMIZATION AND NONLINEAR PROGRAMMING [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1972, 6 (12): : 95 - 97
- [7] EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING [J]. MATHEMATICAL PROGRAMMING, 1989, 44 (02) : 127 - 137
- [8] Persistency in 0-1 polynomial programming [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (02) : 359 - 389
- [9] A NEW ALGORITHM TO FIND ALL VERTICES OF A POLYTOPE [J]. OPERATIONS RESEARCH LETTERS, 1989, 8 (05) : 261 - 264
- [10] The 0-1 Knapsack Polytope - A Starting Point for Cryptanalysis of Knapsack Ciphers? [J]. APPLICATIONS AND TECHNIQUES IN INFORMATION SECURITY, ATIS 2014, 2014, 490 : 171 - 182