Pages that link to "Item:Q5429275"

The following pages link to A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (Q5429275):

Displaying 16 items.

• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
• Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
• A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• (Q5425124) (← links)
• Quantum graph drawing (best student paper) (Q6575378) (← links)