Pages that link to "Item:Q1341991"

The following pages link to Minimization of a quadratic pseudo-Boolean function (Q1341991):

Displaying 16 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← 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)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
• Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms (Q1390245) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)