SCOPUS 정보 검색 플랫폼

Volumn 73, Issue 1, 1997, Pages 81-99

Resolution search

Author keywords

Branch and bound; Implicit enumeration; Mixed zero one linear programming problems; Satisfiability; Search problems

Indexed keywords

EID: 18244419040 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(96)00003-0 Document Type: Article

Times cited : (19)

References (6)

1
- 0001936813
- On renamable and generalized Horn functions
- V. Chandru, C.R. Coullard, P.L. Hammer, M. Montanez and X. Sun, On renamable and generalized Horn functions, Ann. Math. Artificial Intelligence 1 (1990) 33-47.
- (1990) Ann. Math. Artificial Intelligence , vol.1 , pp. 33-47
- Chandru, V.¹ Coullard, C.R.² Hammer, P.L.³ Montanez, M.⁴ Sun, X.⁵

2
- 0003792618
- Wiley, New York
- R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory (Wiley, New York, 1990).
- (1990) Ramsey Theory
- Graham, R.L.¹ Rothschild, B.L.² Spencer, J.H.³

3
- 84976816031
- Renaming a set of clauses as a Horn set
- H.R. Lewis, Renaming a set of clauses as a Horn set, J. ACM 25 (1978) 134-135.
- (1978) J. ACM , vol.25 , pp. 134-135
- Lewis, H.R.¹

4
- 85101463362
- Wiley, New York
- G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
- (1988) Integer and Combinatorial Optimization
- Nemhauser, G.L.¹ Wolsey, L.A.²

5
- 84918983692
- A machine-oriented logic based on the resolution principle
- J.A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM 12 (1965) 23-41.
- (1965) J. ACM , vol.12 , pp. 23-41
- Robinson, J.A.¹

6
- 0000590051
- Beweis einer baudetschen vermutung
- B.L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk. 15 (1927) 212-216.
- (1927) Nieuw Arch. Wisk. , vol.15 , pp. 212-216
- Van Der Waerden, B.L.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.