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

DOI10.1016/J.NEUNET.2008.09.008zbMATH Open1335.90104OpenAlexW4233980468WikidataQ47245591 ScholiaQ47245591MaRDI QIDQ280315FDOQ280315

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

Recommendations

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

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)

Cites Work

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

Cited In (14)

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

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)