Solving Graph Partitioning Problems with Parallel Metaheuristics

Zbigniew Kokosiński; Marcin Bała

doi:10.1007/978-3-319-59861-1_6

ScienceGate Book Chapters

BOOK-CHAPTER

Solving Graph Partitioning Problems with Parallel Metaheuristics

Zbigniew Kokosiński Marcin Bała

Year: 2017 Studies in computational intelligence Pages: 89-105 Publisher: Springer Nature

DOI: 10.1007/978-3-319-59861-1_6

Get Full-Text PDF Get Analytical Report

Keywords:

Metaheuristic Parallel metaheuristic Solver Computer science Graph Graph partition Vertex (graph theory) Mathematical optimization Theoretical computer science Algorithm Mathematics

Metrics

Cited By

1.36

FWCI (Field Weighted Citation Impact)

Refs

0.82

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Solving Graph Partitioning Problems with Parallel Metaheuristics

Metrics

Citation History

Topics

Related Documents

Testing of parallel metaheuristics for graph partitioning problems

Efficiency of parallel metaheuristics for solving combinatorial problems

Application of Parallel and Hybrid Metaheuristics for Graph Partitioning Problem

Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics

Leveraging heterogeneous parallel platform in solving hard discrete optimization problems with metaheuristics