New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
Data up to Jan 2025
Total Citations Per Year
Abstract
References (16)
Genetic algorithms in search, optimization, and machine learning
1989 • 49,726 citations
An Efficient Heuristic Procedure for Partitioning Graphs
1970 • 5,215 citations
Some simplified NP-complete graph problems
1976 • 2,051 citations
The Lagrangian Relaxation Method for Solving Integer Programming Problems
1981 • 2,035 citations
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
1989 • 1,461 citations
Proceedings of the third international conference on Genetic algorithms
1989 • 1,206 citations
Alleles, loci and the traveling salesman problem
1985 • 1,000 citations
Some guidelines for genetic algorithms with penalty functions
1989 • 504 citations
Using Genetic Algorithms to Solve NP-Complete Problems
1989 • 352 citations
Discrete space location-allocation solutions from genetic algorithms
1986 • 150 citations
Using genetic algorithms to schedule flow shop releases
1989 • 115 citations
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
1979 • 115 citations
A Genetic Algorithm Approach to Multiple-Fault Diagnosis
1991 • 59 citations
Computer science and operations research: New developments in their interfaces
1994 • 30 citations
HEURISTIC SOLUTION PROCEDURES FOR THE GRAPH PARTITIONING PROBLEM
1992 • 11 citations
Abstract heuristic search methods for graph partitioning
1991 • 10 citations