Pages that link to "Item:Q4012442"

The following pages link to Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442):

Displaying 22 items.

• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• 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)
• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
• A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
• A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
• Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
• (Q5075808) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Optimal design of line replaceable units (Q6150236) (← links)