Pages that link to "Item:Q604951"

The following pages link to An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951):

Displayed 7 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) ‎ (← links)
• An efficient DC programming approach for portfolio decision with higher moments (Q409263) ‎ (← links)
• Exact penalty and error bounds in DC programming (Q427389) ‎ (← links)
• New formulations of the multiple sequence alignment problem (Q628651) ‎ (← links)
• Properties of two DC algorithms in quadratic programming (Q628748) ‎ (← links)
• A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) ‎ (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) ‎ (← links)