Performance of parallel branch-and-bound algorithms

No abstract is available for this paper.

• Publication year

  1985

• Venue

  IEEE transactions on computers

• Publication date

  1985-10-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/TC.1985.6312201
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Anomalies in parallel branch-and-bound algorithms

  1984cited by this paper
• Experience with Two Parallel Programs Solving the Traveling Salesman Problem

  1983cited by this paper
• Fundamentals of Computer Algorithms

  1978cited by this paper

• A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

  2018cites this paper
• A Parallelization Mixing OR-Tools/Gecode Solvers on Top of the Bobpp Framework

  2013cites this paper
• Partitioning Methods to Parallelize Constraint Programming Solver Using the Parallel Framework Bobpp

  2013cites this paper
• Anticipated Dynamic Load Balancing Strategy to Parallelize Constraint Programming Search

  2013cites this paper
• Optimal Sequential Backward Flow Saturation for cell transmission model

  2012cites this paper
• Automated partitioning design in parallel database systems

  2011cites this paper
• Grid Branch-and-Bound for Permutation Flowshop

  2011cites this paper
• Résolution séquentielles et parallèles des problèmes de découpe / placement. (Exact, approximate and parallel algorithms for the Two-Dimensional Cutting stock Problem)

  2008cites this paper
• A Survey of Parallel Search Algorithms for Discrete Optimization Problems

  2007cites this paper
• Anomalies in distributed branch-and-cut solving of the capacitated vehicle routing problem

  2006cites this paper
• Parallel Algorithm Design for Branch and Bound

  2005cites this paper
• An efficient data structure for branch-and-bound algorithm

  2004cites this paper
• Chapter 5 PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND

  2004cites this paper
• Branch and Bound Algorithms-Principles and Examples

  2003cites this paper
• Parallelization of the scatter search for the p-median problem

  2003cites this paper
• Parallel algorithms for a multi-level network optimization problem

  2003cites this paper
• Parallelization of the Scatter Search Félix Garćıa-López , Belén Melián-Batista

  2002cites this paper
• Parallelization of the Vehicle Routing Problem with Time Windows

  1999cites this paper
• On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search

  1999cites this paper
• An Integer Program Decomposition Approach to Combat Planning.

  1998cites this paper
• On the Synergistic Use of Parallel Exact Solvers and Heuristic/Stochastic Methods for Combinatorial Optimisation Problems: A Study Case for the TSP on the Meiko CS-2

  1996cites this paper
• A global algorithm for the partial scan design problem using circuit state information

  1996cites this paper
• Performances of Parallel Branch and Bound Algorithms with Best-first Search

  1996cites this paper
• Parallel processing for difficult combinatorial optimization problems

  1996cites this paper
• Parallel best-first branch-and-bound in discrete optimization: a framework

  1995influential citation
• Lastverteilung für feinkörnig parallelisiertes Branch-and-Bound

  1995cites this paper
• A Parallel Formulatiion for General Branch-and-Bound Algorithms

  1995cites this paper
• Asynchronous Parallel Branch and Bound and Anomalies

  1995cites this paper
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

  1994cites this paper
• Worst case scheduling for parallel functional programs

  1994cites this paper
• An Efficient Algorithm for Managing a Parallel Heap

  1994cites this paper
• Fast and Efficient Operations on Parallel Priority Queues

  1994cites this paper
• Dynamic programming parallel implementations for the knapsack problem

  1993cites this paper
• Initialization of Parallel Branch-and-bound Algorithms

  1993cites this paper
• Dynamic Programming Parallel Implementations for theKnapsack

  1993cites this paper
• A Survey of Parallel Search Algorithms for Discrete

  1993influential citation
• PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS

  1993cites this paper
• Auswahl von DV-bezogenen Veröffentlichungen

  1992cites this paper
• On the parallel solution of set covering and set partitioning problems

  1992cites this paper
• Managing a Parallel Heap Efficiently

  1991cites this paper
• A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master-Slave Architecture

  1991cites this paper
• Analysis and Implementation of Branch-and Bound Algorithms on a Hypercube Multicomputer

  1990cites this paper
• Computational Efficiency of Parallel Combinatorial OR-Tree Searches

  1990cites this paper
• Large-scale 0–1 linear programming on distributed workstations

  1990cites this paper
• OR Forum - Perspectives on Parallel Computing

  1989cites this paper
• Chapter VI Integer programming

  1989cites this paper
• Live nodes distribution in parallel branch and bound algorithms

  1989cites this paper
• Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

  1989cites this paper
• A study of parallel branch-and-bound algorithms with best-bound-first search

  1989cites this paper
• Is Average Superlinear Speedup Possible?

  1988cites this paper
• Parallel computing in combinatorial optimization

  1988cites this paper
• Branch-and-bound and parallel computation: A historical note

  1988cites this paper
• DIB—a distributed implementation of backtracking

  1987cites this paper
• Perspectives on parallel computing

  1987cites this paper
• Parallel Processing of Combinatorial Search

  1987cites this paper
• A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions

  1986cites this paper
• Survey on special purpose computer architectures for AI

  1986cites this paper
• Performance of Parallel Branch and Bound Algorithms on the Ksr1 Multiprocessor

  year unknowncites this paper