Autocorrelation coefficient for the graph bipartitioning problem

DOI10.1016/S0304-3975(97)00176-XzbMATH Open0902.90134OpenAlexW2072294492MaRDI QIDQ1127331FDOQ1127331

V. Zissimopoulos, Eric Angel

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00176-x

zbMATH Keywords

simulated annealinglocal searchautocorrelation lengthgraph bipartitioning problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Searching and sorting (68P10)

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• The landscape of the traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• The linear ordering problem: instances, search space analysis and algorithms
• Penalty and partitioning techniques to improve performance of QUBO solvers
• Title not available (Why is that?)
• Autocorrelation measures for the quadratic assignment problem
• On the landscape ruggedness of the quadratic assignment problem
• On the classification of NP-complete problems in terms of their correlation coefficient
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
• Probabilistic characterization of random Max \(r\)-Sat
• Neutrality in fitness landscapes.
• Elementary landscape decomposition of the frequency assignment problem

   Recommendations

• On the classification of NP-complete problems in terms of their correlation coefficient 👍 👎
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning 👍 👎
• Combining simulated annealing with local search heuristics 👍 👎
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning 👍 👎

This page was built for publication: Autocorrelation coefficient for the graph bipartitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127331)