A deterministic annealing algorithm for approximating a solution of the min-bisection problem

DOI10.1016/J.NEUNET.2008.09.008MaRDI QIDQ280315zbMATHOpenAlexWikidataFDO

Authors Chuangyin Dang, Wei Ma, Jiye Liang

Publication date 10 May 2016

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2008.09.008

zbMATH Keywords

iterative algorithmdescent directiondeterministic annealinglog-cos barrier function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Recommendations

• An approximation algorithm for graph partitioning via deterministic annealing neural network
• scientific article; zbMATH DE number 7234705
• A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem
• scientific article; zbMATH DE number 5734227
• scientific article; zbMATH DE number 2245551

Cites work

• scientific article; zbMATH DE number 997367 (Why is no real title available?)
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 167601 (Why is no real title available?)
• scientific article; zbMATH DE number 735099 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
• A Polylogarithmic Approximation of the Minimum Bisection
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• A neural network algorithm for the multiple traveling salesman problem
• A spectral heuristic for bisecting random graphs
• A survey for the quadratic assignment problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Bisecting a 4-connected graph with three resource sets
• Genetic algorithm and graph partitioning
• On the graph bisection problem
• Some NP-complete problems in quadratic and nonlinear programming
• The Metropolis algorithm for graph bisection
• ``Neural computation of decisions in optimization problems

Cited in

(15)

• A deterministic annealing algorithm for the minimum concave cost network flow problem
• A logarithmic descent direction algorithm for the quadratic knapsack problem
• A new filled function method for unconstrained global optimization
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
• An approximation algorithm for graph partitioning via deterministic annealing neural network
• A filled function which has the same local minimizer of the objective function
• A new parameter free filled function for solving unconstrained global optimization problems
• Transformation of energy landscape in the problem of binary minimization
• A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem
• scientific article; zbMATH DE number 7234705 (Why is no real title available?)
• A new filled function for global minimization and system of nonlinear equations
• Annealing algorithms for multisource absolute location problems on graph
• A filled function method for global optimization with inequality constraints
• A new filled function method with two parameters for global optimization
• A deterministic annnealing algorithm for a combinatorial optimization problem using replicator equations

This page was built for publication: A deterministic annealing algorithm for approximating a solution of the min-bisection problem

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