Pages that link to "Item:Q3539803"
From MaRDI portal
The following pages link to Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803):
Displaying 20 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Quadratic convex reformulations for quadratic 0-1 programming (Q941006) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Quadratic binary programming models in computational biology (Q2867346) (← links)
- Convex Relaxations of (0, 1)-Quadratic Programming (Q4864871) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
