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):

Displaying 26 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• 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 continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks (Q1652272) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
• A DC programming approach for solving a centralized group key management problem (Q2091090) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• DC Programming and DCA for General DC Programs (Q3192952) (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
• Solving the Production and Maintenance Optimization Problem by a Global Approach (Q5357763) (← links)
• DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• New approach to solve unconstrained binary quadratic problem (Q6658442) (← links)
• Tighter convex underestimator for general twice differentiable function for global optimization (Q6667337) (← links)