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

DOI10.1016/j.neunet.2008.09.008zbMath1335.90104OpenAlexW4233980468WikidataQ47245591 ScholiaQ47245591MaRDI QIDQ280315

Wei Ma, Chuangyin Dang, J. Y. 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 algorithmdeterministic annealingdescent directionlog-cos barrier function

Mathematics Subject Classification ID

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

Related Items (10)

A new parameter free filled function for solving unconstrained global optimization problems ⋮ Transformation of energy landscape in the problem of binary minimization ⋮ A new filled function for global minimization and system of nonlinear equations ⋮ 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 new filled function method with two parameters for global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ A filled function method for global optimization with inequality constraints ⋮ A logarithmic descent direction algorithm for the quadratic knapsack problem ⋮ A filled function which has the same local minimizer of the objective function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey for the quadratic assignment problem
• Bisecting a 4-connected graph with three resource sets
• ``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
• Some NP-complete problems in quadratic and nonlinear programming
• On the graph bisection problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Genetic algorithm and graph partitioning
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• A Polylogarithmic Approximation of the Minimum Bisection

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