Parallel Algorithm Design for Branch and Bound

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/0-387-22827-6_5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parallel Programming

  2005cited by this paper
• A fast, parallel spanning tree algorithm for symmetric multiprocessors

  2004cited by this paper
• The Euler tour technique and parallel rooted spanning tree

  2004cited by this paper
• Parallel Scientific Computation: A Structured Approach using BSP and MPI

  2004cited by this paper
• Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

  2004cited by this paper
• High-performance algorithms for phylogeny reconstruction with maximum parsimony

  2004cited by this paper
• A Library Hierarchy for Implementing Scalable Parallel Search Algorithms

  2004cited by this paper
• Sourcebook of parallel computing

  2003cited by this paper
• Parallel programming in C with MPI and OpenMP

  2003cited by this paper
• Review of Algorithms sequential & parallel: a unified approach by R. Miller & L. Boxer. Prentice Hall 2000

  2003cited by this paper
• A Component Architecture for LAM/MPI

  2003cited by this paper
• Parallel branch, cut, and price for large-scale discrete optimization

  2003cited by this paper
• Fundamentals of Parallel Processing

  2002cited by this paper
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling

  2002cited by this paper
• MPICH-G2: A Grid-enabled implementation of the Message Passing Interface

  2002cited by this paper
• LAM: An Open Cluster Environment for MPI

  2002cited by this paper
• Solving large quadratic assignment problems on computational grids

  2002cited by this paper
• Pico: An Object-Oriented Framework for Parallel Branch and Bound *

  2001cited by this paper
• The Anatomy of the Grid: Enabling Scalable Virtual Organizations

  2001cited by this paper
• Industrial applications of high-performance computing for phylogeny reconstruction

  2001cited by this paper
• Master–Worker: An Enabling Framework for Applications on the Computational Grid

  2001cited by this paper
• Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture

  2001cited by this paper
• A new bound for the quadratic assignment problem based on convex quadratic programming

  2001cited by this paper
• Solving quadratic assignment problems using convex quadratic programming relaxations

  2001cited by this paper
• Algorithms sequential and parallel: a unified approach

  2001cited by this paper
• A New Implmentation and Detailed Study of Breakpoint Analysis

  2000cited by this paper
• An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae

  2000cited by this paper
• FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver

  2000cited by this paper
• Algorithm Engineering for Parallel Computation

  2000cited by this paper
• GRAPPA runs in record time

  2000cited by this paper
• Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families"

  2000cited by this paper
• Introduction to UPC and Language Specification

  2000cited by this paper
• Parallel programming in openMP

  2000cited by this paper
• Molecular Evolution and Phylogenetics

  2000cited by this paper
• Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees

  2000cited by this paper
• SPRNG: A Scalable Library for Pseudorandom Number Generation

  1999cited by this paper
• Legion: An Operating System for Wide-Area Computing

  1999cited by this paper
• The network weather service: a distributed resource performance forecasting service for metacomputing

  1999cited by this paper
• Designing Practical Efficient Algorithms for Symmetric Multiprocessors

  1999cited by this paper
• Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima

  1999cited by this paper
• An Improved Randomized Selection Algorithm With an Experimental Study (Extended Abstract)

  1999influential reference
• The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis

  1999cited by this paper
• Formulations and hardness of multiple sorting by reversals

  1999cited by this paper
• Toward Scalable Performance Visualization with Jumpshot

  1999cited by this paper
• Algorithms Sequential & Parallel: A Unified Approach

  1999cited by this paper
• Running EveryWare on the Computational Grid

  1999cited by this paper
• The Grid 2: Blueprint for a New Computing Infrastructure

  1998cited by this paper
• Multiple Genome Rearrangement and Breakpoint Phylogeny

  1998cited by this paper
• Models and languages for parallel computation

  1998cited by this paper
• The median problems for breakpoints are NP-complete

  1998cited by this paper
• Parameterized Complexity

  1998cited by this paper
• Applying NetSolve's network-enabled server

  1998cited by this paper
• Dynamically forecasting network performance using the Network Weather Service

  1998cited by this paper
• Parallel programming: techniques and applications using networked workstations and parallel computers

  1998cited by this paper
• Parallel Computer Architecture: A Hardware/Software Approach

  1998cited by this paper
• Titanium: A High-performance Java Dialect

  1998cited by this paper
• An improved approximation algorithm for multiway cut

  1998cited by this paper
• A Randomized Parallel Sorting Algorithm with an Experimental Study

  1998cited by this paper
• Topics in parallel integer optimization

  1998cited by this paper
• Minimizing average completion time in the presence of release dates

  1998cited by this paper
• Globus: a Metacomputing Infrastructure Toolkit

  1997cited by this paper
• Parsimony is Hard to Beat

  1997cited by this paper
• Distributed Termination Detection with Sticky State Indicators

  1997cited by this paper
• pPCx: Parallel Software for Linear Programming

  1997cited by this paper
• Building a parallel branch and bound library

  1996cited by this paper
• Programming with threads

  1996cited by this paper
• MPI: The Complete Reference

  1996cited by this paper
• Interfacing Condor and PVM to harness the cycles of workstation clusters

  1996cited by this paper
• A generalized utility for parallel branch and bound algorithms

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

  1994cited by this paper
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5

  1994cited by this paper
• Introduction to Parallel Computing

  1994cited by this paper
• Acceleration Anomalies in Parallel Branch and Bound Algorithms

  1994cited by this paper
• The Chaco user`s guide. Version 1.0

  1993cited by this paper
• Performance visualization for parallel programs

  1993cited by this paper
• Synthesis of Parallel Algorithms

  1993cited by this paper
• Sun Microsystems Inc.

  1993cited by this paper
• An Introduction to Parallel Algorithms

  1992cited by this paper
• Parallel Sorting by Regular Sampling

  1992cited by this paper
• Prefix sums and their applications

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

  1990cited by this paper
• A bridging model for parallel computation

  1990cited by this paper
• Polyhedral Combinatorics

  1989cited by this paper
• Scans as Primitive Parallel Operations

  1989cited by this paper
• Geometric Retrieval in Parallel

  1988cited by this paper
• A note on the neighbor-joining algorithm of Saitou and Nei.

  1988cited by this paper
• The neighbor-joining method: a new method for reconstructing phylogenetic trees.

  1987cited by this paper
• Algorithms for distributed termination detection

  1987cited by this paper
• Coping with Anomalies in Parallel Branch-and-Bound Algorithms

  1986cited by this paper
• Performance of parallel branch-and-bound algorithms

  1985cited by this paper
• Distance Methods and the Approximation of Most-Parsimonious Trees

  1985cited by this paper
• A new polynomial-time algorithm for linear programming

  1984cited by this paper
• Branch and bound algorithms to determine minimal evolutionary trees

  1982cited by this paper
• Simple method for constructing phylogenetic trees from distance matrices.

  1981cited by this paper
• Parallelism in random access machines

  1978cited by this paper
• Estimating Phylogenetic Trees from Distance Matrices

  1972cited by this paper
• Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology

  1971cited by this paper
• An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

  1968cited by this paper
• Atlas of protein sequence and structure

  1965cited by this paper

• Efficient Lightweight Coordinated Sampling for Dynamic Flows: Theory and Implementation

  2026cites this paper
• Reusable Object-Oriented Parallelization of Branch-and-Bound Algorithms

  2025cites this paper
• Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic

  2025cites this paper
• Lightweight Coordinated Sampling for Dynamic Flows under Budget Constraints

  2024cites this paper
• An optimal real-time pricing strategy for aggregating distributed generation and battery storage systems in energy communities: A stochastic bilevel optimization approach

  2023cites this paper
• Covariate Balancing Methods for Randomized Controlled Trials Are Not Adversarially Robust

  2021cites this paper
• High Performance Optimization at the Door of the Exascale

  2021cites this paper
• Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers

  2020cites this paper
• A hybrid sample generation approach in speculative multithreading

  2019cites this paper
• Optimal hypergraph partitioning

  2018cites this paper
• Parallel algorithms for computing the smallest binary tree size in unit simplex refinement

  2018cites this paper
• Information extraction and dimensionality reduction of hyperspectral datasets through spectral region analyses

  2018cites this paper
• Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms

  2018cites this paper
• Chapter 9 Parallel Constraint Programming

  2018cites this paper
• A review of literature on parallel constraint solving

  2018cites this paper
• Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms

  2018cites this paper
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs

  2018cites this paper
• Parallel Constraint Programming

  2018cites this paper
• Evaluación del planificador automatizado OPTIC al generar rutas de aprendizaje mediante el uso de cotas superiores y extensión del modelo matemático

  2018cites this paper
• MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications

  2018cites this paper
• Cost-effectiveness optimization for SO 2 emissions control from coal-fired power plants on a national scale: A case study in China

  2017cites this paper
• Parallel algorithm of navier-stokes model for magnetic nanoparticles drug delivery system on distributed parallel computing system

  2017cites this paper
• Spectral region identification versus individual channel selection in supervised dimensionality reduction of hyperspectral image data

  2017cites this paper
• IVM‐based parallel branch‐and‐bound using hierarchical work stealing on multi‐GPU systems

  2017cites this paper
• Unraveling Blockchain based Crypto-currency System Supporting Oblivious Transactions: a Formalized Approach

  2017cites this paper
• Integrating the Nqueens Algorithm into a Parameterized Benchmark Suite

  2016cites this paper
• Embarrassingly Parallel Search in Constraint Programming

  2016cites this paper
• A hybrid sample generation approach in speculative multithreading

  2016cites this paper
• Algorithms for Graph-Constrained Coalition Formation in the Real World

  2016cites this paper
• PARALLEL COMPUTING OF NUMERICAL SCHEMES AND BIG DATA ANALYTIC FOR SOLVING REAL LIFE APPLICATIONS

  2016cites this paper
• Constraint Optimisation Techniques for Real-World Applications

  2015cites this paper
• PEBBL: an object-oriented framework for scalable parallel branch and bound

  2015cites this paper
• Applications of Parallel Computing for Facility Location-Transportation Problems for Disaster Response

  2015cites this paper
• Anatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing

  2015cites this paper
• A parallel tree based strategy for 3-way interaction testing

  2015cites this paper
• The parallelization of helmholtz equation related to breast cancer growth

  2015cites this paper
• Optimisation of motorway operations via ramp metering and variable speed limits

  2015cites this paper
• Algorithms for bundling and pricing trucking services: Deterministic and stochastic approaches

  2015cites this paper
• Phasor Measurement Unit Placement for Identifying Power Line Outages in Wide-Area Transmission System Monitoring

  2014cites this paper
• The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound

  2014cites this paper
• Graphics processing unit‐accelerated bounding for branch‐and‐bound applied to a permutation problem using data access optimization

  2014cites this paper
• Balancing reconfigurable machining lines via a set partitioning model

  2014cites this paper
• Anytime coalition structure generation on synergy graphs

  2014cites this paper
• Parallel heterogeneous Branch and Bound algorithms for multi-core and multi-GPU environments. (Algorithmes Branch and Bound parallèles hétérogènes pour environnements multi-coeurs et multi-GPU)

  2013cites this paper
• RESEARCH ARTICLE Balancing recongurable machining lines via a set partitioning model

  2013cites this paper
• Operator-Level GPU-Accelerated Branch and Bound Algorithms

  2013cites this paper
• Combining multi-core and GPU computing for solving combinatorial optimization problems

  2013cites this paper
• Benefits of in-Vehicle Consolidation in Less than Truckload Freight Transportation Operations

  2013cites this paper
• High Performance Computing as a Combination of Machines and Methods and Programming

  2013influential citation
• Multi-Threading a State-of-the-Art Maximum Clique Algorithm

  2013cites this paper
• International Conference on Computational Science , ICCS 2013 Operator-level GPU-accelerated Branch and Bound algorithms

  2013cites this paper
• Computational Challenges in Emerging Combinatorial Scientific Computing Applications

  2012cites this paper
• Mathematical optimization techniques for resource allocation in cognitive radio networks

  2011cites this paper
• Solving the Permutation Flow Shop Problem with Makespan Criterion using Grids

  2011cites this paper
• A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem

  2010cites this paper
• Design of parallel distributed algorithm for the Permutation Flow Shop Problem

  2010cites this paper
• Branch-and-Bound interval global optimization on shared memory multiprocessors

  2008influential citation
• Solving the mixture design problem on a shared memory parallel machine

  2007cites this paper
• ParaLEX: A Parallel Extension for the CPLEX Mixed Integer Optimizer

  2007cites this paper
• Phylospaces: reconstructing evolutionary trees in tuple space

  2006cites this paper
• Parallelization of a Maximum Parsimony Branch and Bound Algorithm for Phylogenetic Inference

  2006cites this paper
• Scalability of Integer Programming Computations for Sensor Placement in Water Networks

  2005cites this paper
• 1 High-Performance Phylogeny Reconstruction Under Maximum Parsimony

  2004cites this paper