Pages that link to "Item:Q913658"

The following pages link to Upper-bounds for quadratic 0-1 maximization (Q913658):

Displaying 17 items.

• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)