Pages that link to "Item:Q1893147"
From MaRDI portal
The following pages link to A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147):
Displaying 8 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)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
