Pages that link to "Item:Q2848171"

The following pages link to Solving Mixed Integer Bilinear Problems Using MILP Formulations (Q2848171):

Displaying 2 items.

• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)