Pages that link to "Item:Q757239"

The following pages link to Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239):

Displaying 15 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
• Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
• QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• The maximum clique problem (Q1318271) (← links)
• A quadratic assignment formulation of the molecular conformation problem (Q1319011) (← links)
• Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• An implicit enumeration method for global optimization problems (Q2641085) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)