An approximation algorithm for graph partitioning via deterministic annealing neural network
From MaRDI portal
(Redirected from Publication:2185605)
Recommendations
- scientific article; zbMATH DE number 7234705
- scientific article; zbMATH DE number 1329958
- \(D^{3}G^{2}A\): the dynamic distributed double guided genetic algorithm for the \(K\)-graph partitioning problem
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- An improved neural computing algorithm for the m-way graph partitioning problem
Cites work
- ``Neural computation of decisions in optimization problems
- A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A reactive self-tuning scheme for multilevel graph partitioning
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
- An Operation Partitioning Problem for Automated Assembly System Design
- Geometric Mesh Partitioning: Implementation and Experiments
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 51089 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- Improved linearized models for graph partitioning problem under capacity constraints
- Neurons with graded response have collective computational properties like those of two-state neurons
Cited in
(21)- Improved recurrent neural network-based manipulator control with remote center of motion constraints: experimental results
- MGAT: multi-view graph attention networks
- Sliding-mode variable structure control for complex automatic systems: a survey
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Stationary distribution and ergodicity of a stochastic cholera model with multiple pathways of transmission
- Finite-time synchronization of input delay complex networks via non-fragile controller
- Solving the production transportation problem via a deterministic annealing neural network method
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Command filtering-based adaptive fuzzy control for permanent magnet synchronous motors with full-state constraints
- Generalized Cauchy process based on heavy-tailed distribution and grey relational analysis for reliability predicting of distribution systems
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- scientific article; zbMATH DE number 7234705 (Why is no real title available?)
- scientific article; zbMATH DE number 4201664 (Why is no real title available?)
- An improved neural computing algorithm for the m-way graph partitioning problem
- scientific article; zbMATH DE number 1329958 (Why is no real title available?)
- Prescribed performance synchronization of complex dynamical networks with event-based communication protocols
- Quantized control for a class of neural networks with adaptive event‐triggered scheme and complex cyber‐attacks
- Dynamic path planning of mobile robot based on improved simulated annealing algorithm
- Distributed finite-time optimisation algorithm for second-order multi-agent systems subject to mismatched disturbances
- A Lagrange barrier approach for the minimum concave cost supply problem via a logarithmic descent direction algorithm
- Optimizing connected components graph partitioning with minimum size constraints using integer programming and spectral clustering techniques
This page was built for publication: An approximation algorithm for graph partitioning via deterministic annealing neural network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185605)
