Pages that link to "Item:Q1079494"

The following pages link to A solvable case of quadratic 0-1 programming (Q1079494):

Displaying 29 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• Locating facilities which interact: Some solvable cases (Q689235) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
• Computational complexity of norm-maximization (Q757258) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• Experiments in quadratic 0-1 programming (Q1123806) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• A solvable class of quadratic 0-1 programming (Q1193723) (← links)
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
• Checking robust nonsingularity is NP-hard (Q1802197) (← links)
• An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
• A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
• The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints (Q2367400) (← links)
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
• The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
• Efficient joint object matching via linear programming (Q6052052) (← links)
• On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
• Adaptive randomization in network data (Q6200871) (← links)