Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
DOI10.1007/BF02023057zbMATH Open0722.90047OpenAlexW2035758901MaRDI QIDQ757239FDOQ757239
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
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
hypercubecomputational resultsdistributed memory multiprocessor typeparallel branch-and-bound algorithm
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)
Cites Work
- Constrained global optimization: algorithms and applications
- Title not available (Why is that?)
- A parallel branch and bound algorithm for the quadratic assignment problem
- Minimum cuts and related problems
- Methods of Nonlinear 0-1 Programming
- A solvable case of quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- A parallel integer linear programming algorithm
Cited In (20)
- Improved row-by-row method for binary quadratic optimization problems
- The maximum clique problem
- The unconstrained binary quadratic programming problem: a survey
- Box-constrained quadratic programs with fixed charge variables
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Complexity of uniqueness and local search in quadratic 0-1 programming
- A quadratic assignment formulation of the molecular conformation problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Piecewise convex maximization approach to multiknapsack
- A branch and bound algorithm for the maximum clique problem
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- An implicit enumeration method for global optimization problems
- Parallel branch and bound on fine-grained hypercube multiprocessors
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- Building an iterative heuristic solver for a quantum annealer
- Parallel processing for difficult combinatorial optimization problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
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)
