Pages that link to "Item:Q1374368"

The following pages link to Prediction of oligopeptide conformations via deterministic global optimization (Q1374368):

Displaying 32 items.

• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids (Q709368) (← links)
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
• On generalized geometric programming problems with non-positive variables (Q857357) (← links)
• A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
• A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
• Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
• Computing lower and upper expectations under epistemic independence (Q881798) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• Predicting peptides structure with solvation potential and rotamer library dependent of the backbone (Q924393) (← links)
• A network flow model for biclustering via optimal re-ordering of data matrices (Q989888) (← links)
• Convexity of products of univariate functions and convexification transformations for geometric programming (Q1014014) (← links)
• Molecular conformation of \(n\)-alkanes using terrain/funneling methods (Q1029676) (← links)
• \textit{Ab initio} folding of peptides by the optimal-bias Monte Carlo minimization procedure (Q1305998) (← links)
• Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
• Global energy minimization of alanine dipeptide via barrier function methods (Q1631284) (← links)
• Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
• Global optimization of generalized geometric programming (Q1779583) (← links)
• Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials (Q1883192) (← links)
• A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
• On the functional form of convex underestimators for twice continuously differentiable functions (Q2458918) (← links)
• Posynomial geometric programming with interval exponents and coefficients (Q2462103) (← links)
• Accelerating method of global optimization for signomial geometric programming (Q2479370) (← links)
• Prediction of peptide conformation using a scale-transformed entropy sampling algorithm (Q2490612) (← links)
• A global optimization algorithm using linear relaxation (Q2507847) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
• Posynomial geometric programming with parametric uncertainty (Q2569031) (← links)
• A deterministic global optimization algorithm for generalized geometric programming (Q2572718) (← links)
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)