Pages that link to "Item:Q1780534"
From MaRDI portal
The following pages link to A branch and bound algorithm for solving a class of D-C programming (Q1780534):
Displaying 12 items.
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483) (← links)
- Resolution search and dynamic branch-and-bound (Q1810862) (← 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)
- Mean-variance portfolio optimal problem under concave transaction cost (Q2490186) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- (Q5128175) (← links)
