Pages that link to "Item:Q2288865"

The following pages link to Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865):

Displaying 10 items.

• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
• Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Fast, flexible, and exact minimum flow decompositions via ILP (Q2170151) (← links)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
• Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
• Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356) (← links)