1974
DOI: 10.1038/248761a0
|View full text |Cite
|
Sign up to set email alerts
|

Applications of Boolean programming optimisation methodology to the direct solution of crystal structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1974
1974
1976
1976

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…This approach, which is described in more detail elsewhere (Klunk & Meyer, 1974), is otherwise known as Boolean programming. It can be formulated by constructing an objective function and inequality constraints as follows" D Maximize CX subject to: AX-b>_'O where all X are zero or one in value.…”
Section: (B) Boolean Programmingmentioning
confidence: 99%
“…This approach, which is described in more detail elsewhere (Klunk & Meyer, 1974), is otherwise known as Boolean programming. It can be formulated by constructing an objective function and inequality constraints as follows" D Maximize CX subject to: AX-b>_'O where all X are zero or one in value.…”
Section: (B) Boolean Programmingmentioning
confidence: 99%