Pages that link to "Item:Q2629636"

The following pages link to Continuous quadratic programming formulations of optimization problems on graphs (Q2629636):

Displaying 10 items.

• The MIN-cut and vertex separator problem (Q683339) (← links)
• A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
• New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
• On conjectures of network distance measures by using graph spectra (Q2043383) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)