Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
The paper reports on the computational results from running a parallel branch-and-bound algorithm for quadratic 0/1 programs on two hypercube systems: iPSC/1 32-node hypercube at the University of Colorado and iPSC/2 16-node hypercube at Pennsylvania State University. These systems are of distributed memory multiprocessor type with homogeneous multiprocessing application. The report is preceeded by a description of the algorithm which computes lower and upper bounds for the continuous partial derivatives of the free variables used for forcing variables. The parallelization is accomplished by splitting of the enumeration tree into subtrees of a given size which become subproblems for the free nodes of the hypercube.
- 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
- 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
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Parallel processing for difficult combinatorial optimization problems
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- Improved row-by-row method for binary quadratic optimization problems
- Building an iterative heuristic solver for a quantum annealer
- An implicit enumeration method for global optimization problems
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Piecewise convex maximization approach to multiknapsack
- The unconstrained binary quadratic programming problem: a survey
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- A branch and bound algorithm for the maximum clique problem
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Parallel branch and bound on fine-grained hypercube multiprocessors
- Box-constrained quadratic programs with fixed charge variables
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)
