Pages that link to "Item:Q951124"

The following pages link to A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124):

Displaying 13 items.

• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
• Generalized roof duality (Q714031) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← links)
• Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
• Penalty weights in QUBO formulations: permutation problems (Q2163796) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)