Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture

DOI10.1007/BF02023057zbMath0722.90047OpenAlexW2035758901MaRDI QIDQ757239

Panos M. Pardalos, Gregory P. Rodgers

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023057

zbMATH Keywords

hypercubecomputational resultsdistributed memory multiprocessor typeparallel branch-and-bound algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items (19)

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations ⋮ An implicit enumeration method for global optimization problems ⋮ 0-1 Quadratic programming approach for optimum solutions of two scheduling problems ⋮ An algorithm for finding a maximum weighted independent set in an arbitrary graph ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Box-constrained quadratic programs with fixed charge variables ⋮ Complexity of uniqueness and local search in quadratic 0-1 programming ⋮ A branch and bound algorithm for the maximum clique problem ⋮ A new linearization technique for multi-quadratic 0-1 programming problems. ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Piecewise convex maximization approach to multiknapsack ⋮ QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm ⋮ Solving quadratic (0,1)-problems by semidefinite programs and cutting planes ⋮ Improved row-by-row method for binary quadratic optimization problems ⋮ The maximum clique problem ⋮ A quadratic assignment formulation of the molecular conformation problem

Cites Work

• Unnamed Item
• A solvable case of quadratic 0-1 programming
• A parallel branch and bound algorithm for the quadratic assignment problem
• A parallel integer linear programming algorithm
• Constrained global optimization: algorithms and applications
• Graph separation techniques for quadratic zero-one programming
• Methods of Nonlinear 0-1 Programming
• Minimum cuts and related problems

This page was built for publication: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture