Pages that link to "Item:Q1785732"

The following pages link to A MAX-CUT formulation of 0/1 programs (Q1785732):

Displayed 14 items.

• A multilevel analysis of the Lasserre hierarchy (Q1735163) ‎ (← links)
• Gaussian mean field lattice gas (Q1753883) ‎ (← links)
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) ‎ (← links)
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) ‎ (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) ‎ (← links)
• Bounds for Random Binary Quadratic Programs (Q4609468) ‎ (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) ‎ (← links)
• BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) ‎ (← links)
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) ‎ (← links)
• Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) ‎ (← links)
• Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) ‎ (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) ‎ (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) ‎ (← links)
• Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) ‎ (← links)