The following pages link to (Q5128175):
Displaying 12 items.
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777) (← links)
- The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- (Q4581828) (← links)
