Pages that link to "Item:Q1314325"

The following pages link to On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325):

Displaying 22 items.

• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
• Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
• A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
• Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Unconstrained 0-1 optimization and Lagrangean relaxation (Q2277361) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)
• Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)