The following pages link to (Q4246783):
Displaying 15 items.
- Protein structure optimization by side-chain positioning via beta-complex (Q367168) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids (Q709368) (← links)
- A GA-simplex hybrid algorithm for global minimization of molecular potential energy functions (Q817143) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Analytic evaluation of the gradient and Hessian of molecular potential energy functions (Q878964) (← links)
- Speeding up continuous GRASP (Q976348) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Formulation assistance for global optimization problems (Q1373158) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
- Global optimization of protein-peptide docking by a filling function method (Q2342145) (← links)
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations (Q5138256) (← links)
