Pages that link to "Item:Q817208"
From MaRDI portal
The following pages link to ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208):
Displaying 14 items.
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization (Q3470249) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)