Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel

Cybernetics and Systems Analysis - United States
doi 10.1007/s10559-015-9692-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

A Parallel Tabu Search Algorithm for Solving the Container Loading Problem

Parallel Computing
Computer GraphicsComputer NetworksHardwareCommunicationsComputer-Aided DesignArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2003English

Development and Investigation of Parallel Model of Bee Colony Algorithms for Cryptanalysis Problem Solving

Vestnik of Don State Technical University
2017English

Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2009English

Problem Solving Techniques for the Design of Algorithms

1982English

Bit-Parallel Search Algorithms for Long Patterns

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
1998English

Parallel Problem Solving From Nature

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy