Pages that link to "Item:Q1876594"

The following pages link to Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594):

Displayed 3 items.

• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) ‎ (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) ‎ (← links)
• A difference of convex formulation of value-at-risk constrained optimization (Q3577837) ‎ (← links)