Pages that link to "Item:Q646707"

The following pages link to A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707):

Displaying 25 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Orbitopal fixing (Q408377) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
• New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials (Q2830761) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)