Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Parallel branch-and-bound"”.

  1. A parallel branch and bound algorithm for integer linear programming models

    "A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the …

    must-thes Repository record for A parallel branch and bound algorithm for integer linear programming models (opens in a new tab)

  2. Scalable Parallel Branch-and-Bound with Relaxed Concurrent Queues - A Study of Relaxed Concurrent Queues in Branch-and-Bound using a Generic Solver Framework

    … in exchange for reduced synchronisation overhead and contention. While previous work has demonstrated strong performance for such data structures in isolation, their applicability within complete algorithms and practical workloads remains less explored. This thesis investigates the use of relaxed …

    chalmers Repository record for Scalable Parallel Branch-and-Bound with Relaxed Concurrent Queues - A Study of Relaxed Concurrent Queues in Branch-and-Bound using a Generic Solver Framework (opens in a new tab)

  3. Hierarchiniai lygiagretieji šakų ir rėžių algoritmai heterogeninėms skaičiavimų sistemoms /

    Hierarchical Parallel Branch-and-Bound Algorithms for Heterogeneous High Performance Systems.

    vilnius Repository record for Hierarchiniai lygiagretieji šakų ir rėžių algoritmai heterogeninėms skaičiavimų sistemoms / (opens in a new tab)

  4. OPTIMIZATION ANALYSIS OF PATH PLANNING FOR ADAPTIVE SAMPLING

    Due to the highly nonlinear and dynamical nature of oceanic phenomena, the predictive capability of various ocean models is relatively limited. A practical method to improve the predictive accuracy is using data assimilation technologies to combine in-situ measured and remotely acquired data with …

    nus Repository record for OPTIMIZATION ANALYSIS OF PATH PLANNING FOR ADAPTIVE SAMPLING (opens in a new tab) Download file for OPTIMIZATION ANALYSIS OF PATH PLANNING FOR ADAPTIVE SAMPLING (opens in a new tab)

  5. A subgradient algorithm for nonlinear integer programming and its parallel implementation

    … objective function is introduced. A necessary and sufficient condition for the optimal solution is constructed. And a new algorithm, called the subgradient algorithm, is developed. The algorithm is an iterative procedure, searching for the solution iteratively among feasible points, and in each …

    rice Repository record for A subgradient algorithm for nonlinear integer programming and its parallel implementation (opens in a new tab)

  6. Efficient neural network verification and training

    … exist on the robustness, fairness, privacy and explainability of deep learning systems. In this thesis, we strive to increase trust in deep learning systems by presenting contributions pertaining to neural network verification and training. First, by designing dual solvers for popular …

    oxford Repository record for Efficient neural network verification and training (opens in a new tab)

  7. Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms

    The advent of new technology enhance the speed and reduce the cost for sequencing biological data. Making biological sense of this genomic data is a big challenge to the algorithm design as well as the high performance computing society. There are many problems in Bioinformatics, such as how new …

    gatech Repository record for Enhance the understanding of whole-genome evolution by designing, accelerating and parallelizing phylogenetic algorithms (opens in a new tab)