Pages that link to "Item:Q2276880"

The following pages link to A parallel algorithm for partially separable non-convex global minimization: Linear constraints (Q2276880):

Displaying 7 items.

• New formulations of the multiple sequence alignment problem (Q628651) (← links)
• Global optimization of fractional programs (Q1186270) (← links)
• Sufficient conditions for solving linearly constrained separable concave global minimization problems (Q1207045) (← links)
• Parallel computing in nonconvex programming (Q1309859) (← links)
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)