Pages that link to "Item:Q723488"

The following pages link to DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488):

Displaying 11 items.

• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054) (← links)
• Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594) (← links)
• A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
• (Q4980087) (← links)
• (Q5128175) (← links)
• A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)