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

DOI10.1007/BF02023057MaRDI QIDQ757239zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A parallel branch and bound algorithm for the quadratic assignment problem
• An algorithm for quadratic zero-one programs
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• Simple approaches to parallel branch and bound
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem

Cites work

• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• A parallel branch and bound algorithm for the quadratic assignment problem
• A parallel integer linear programming algorithm
• A solvable case of quadratic 0-1 programming
• 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

Cited in

(20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757239)