Search Results - parallel computing combinatorial algorithms combinatorial scientific computing

Approximation algorithms in combinatorial scientific computing by Pothen, Alex, Ferdous, S. M., Manne, Fredrik

“…We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing…”
Get full text

The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs by Reem, Daniel

“… The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and useful, with several different and important algorithms…”
Get full text

Parallel graph coloring algorithms for distributed GPU environments by Bogle, Ian, Slota, George M., Boman, Erik G., Devine, Karen D., Rajamanickam, Sivasankaran

“…; it identifies sets of independent data that can be updated in parallel. Many algorithms exist for graph coloring on a single GPU or in distributed memory, but to the best of our knowledge, hybrid MPI…”
Get full text

Parallelization of combinatorial search when solving knapsack optimization problem on computing systems based on multicore processors by Rahman, P A

“…This scientific paper deals with the model of the knapsack optimization problem and method of its solving based on directed combinatorial search in the boolean space…”
Get full text

Quantum-inspired metaheuristic algorithms: comprehensive survey and classification by Gharehchopogh, Farhad Soleimanian

“… The Quantum-inspired metaheuristic algorithms were developed by integrating Quantum Computing (QC…”
Get full text

The Zoltan and Isorropia Parallel Toolkits for Combinatorial Scientific Computing: Partitioning, Ordering and Coloring by Boman, Erik G., Çatalyürek, Ümit V., Chevalier, Cédric, Devine, Karen D.

“…Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs…”
Get full text

A cooperative parallel tabu search algorithm for the quadratic assignment problem by James, Tabitha, Rego, Cesar, Glover, Fred

“…In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP…”
Get full text

An optimization spiking neural p system for approximately solving combinatorial optimization problems by Zhang, Gexiang, Rong, Haina, Neri, Ferrante, Pérez-Jiménez, Mario J

“… Spiking neural P systems (SNPS) are a class of distributed and parallel computing models that incorporate the idea of spiking neurons into P systems…”
Get more information

Combinatorial Scientific Computing by Naumann, Uwe, Schenk, Olaf

“…This volume explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures…”
Get full text

Graph coloring algorithms for multi-core and massively multithreaded architectures by Çatalyürek, Ümit V., Feo, John, Gebremedhin, Assefaw H., Halappanavar, Mahantesh, Pothen, Alex

“… We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance…”
Get full text

Hybrid Metaheuristics Based on Evolutionary Algorithms and Simulated Annealing: Taxonomy, Comparison, and Synergy Test by Rodriguez, F. J., Garcia-Martinez, C., Lozano, M.

“…The design of hybrid metaheuristics with ideas taken from the simulated annealing and evolutionary algorithms fields is a fruitful research line…”
Get full text

Parallel Branch-Cut Algorithm Based on Simulated Annealing for Large-Scale Phase Unwrapping by Huang, Qian, Zhou, Huiqun, Dong, Shaochun, Xu, Shijin

“… Owing to only a single process used in most previous algorithm implementations, it becomes more problematic to unwrapping when the required computing resources exceed the capability of one computer…”
Get full text

A practitioner’s guide to quantum algorithms for optimisation problems by Symons, Benjamin C B, Galvin, David, Sahin, Emre, Alexandrov, Vassil, Mensa, Stefano

Get full text

A Unified Framework for Numerical and Combinatorial Computing by Gilbert, John R., Reinhardt, Steve, Shah, Viral B.

“… The authors describe their efforts to build a common infrastructure for numerical and combinatorial computing by using parallel sparse matrices to implement parallel graph…”
Get full text

Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems by Jütte, Silke, Thonemann, Ulrich W.

“…► Decomposition of crew scheduling instances substantially accelerates column generation algorithms…”
Get full text

On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe by Çatalyürek, Ümt V., Aykanat, Cevdet, Uçar, Bora

“…We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation…”
Get full text

A parallel iterated tabu search heuristic for vehicle routing problems by Cordeau, Jean-François, Maischberger, Mirko

“…This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems…”
Get full text

An Adaptive Optimization Spiking Neural P System for Binary Problems by Zhu, Ming, Yang, Qiang, Dong, Jianping, Zhang, Gexiang, Gou, Xiantai, Rong, Haina, Paul, Prithwineel, Neri, Ferrante

“… OSNPS is composed of a family of parallel Spiking Neural P Systems (SNPS) that generate candidate solutions of the binary combinatorial problem and a Guider algorithm that adjusts the spiking probabilities of the neurons of the P systems…”
Get more information

A hybrid genetic algorithm for multiobjective problems with activity analysis-based local search by Whittaker, Gerald, Confesor, Remegio, Griffith, Stephen M., Färe, Rolf, Grosskopf, Shawna, Steiner, Jeffrey J., Mueller-Warrant, George W., Banowetz, Gary M.

“… We describe a parallel computing approach to computation of the genetic algorithm, and apply the algorithm to evaluation of an input tax to regulate pollution…”
Get full text

An optimal multiprocessor combinatorial auction solver by Yang, Shouxi, Segre, Alberto Maria, Codenotti, Bruno

“… The algorithm uses nagging, a technique for parallelizing search in heterogeneous distributed computing environments…”
Get full text