Pages that link to "Item:Q1025992"

The following pages link to Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992):

Displaying 16 items.

• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
• Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)