Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4331736 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reformulating nonlinear combinatorial optimization problems for higher computational efficiency / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank | |||
Normal rank |
Revision as of 13:09, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design |
scientific article |
Statements
Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (English)
0 references
13 December 2005
0 references
peptide and protein design and discovery
0 references
drug design
0 references
in silico sequence selection
0 references
structure prediction
0 references
de novo protein design
0 references
optimization
0 references
0 references