A deterministic annealing algorithm for the minimum concave cost network flow problem
type: Item
instance of: scholarly article
title: A deterministic annealing algorithm for the minimum concave cost network flow problem
zbMATH Open document ID: 1294.90066
author: Yabin Sun
author: Yuping Wang
author: Yang Yang
author: Chuangyin Dang
published in: Neural Networks
publication date: 2013-05-31T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6169046
zbMATH Keywords: concave cost
zbMATH Keywords: network flow
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: Lagrange multiplier
zbMATH Keywords: barrier function
zbMATH Keywords: Lagrange and barrier function
zbMATH Keywords: descent direction
zbMATH Keywords: iterative method
zbMATH Keywords: deterministic annealing
Wikidata QID: Q51580018
MaRDI profile type: Publication
full work available at URL: j.neunet.2011.03.018
OpenAlex ID: W2053699133
cites work: Q3127252
cites work: Q4326408
cites work: A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
cites work: A Polylogarithmic Approximation of the Minimum Bisection
cites work: Heuristic solutions for general concave minimum cost network flow problems
cites work: A branch-and-bound algorithm for concave network flow problems
cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
cites work: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
cites work: Q4833812
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Bisecting a 4-connected graph with three resource sets
cites work: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
cites work: Q3738922
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: Constrained global optimization: algorithms and applications
cites work: Q4034535
cites work: Network flow problems and permutationally concave games
cites work: A neural network algorithm for the multiple traveling salesman problem
cites work: An Extended Projection Neural Network for Constrained Optimization
cites work: New cooperative projection neural network for nonlinearly constrained variational inequality
cites work: A new neural network for solving nonlinear projection equations
DOI: 10.1016/J.NEUNET.2011.03.018
Recommended article: An improved branch and bound algorithm for minimum concave cost network flow problems
Recommended article: Global search algorithms for minimum concave-cost network flow problems
Recommended article: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Recommended article: A deterministic annealing algorithm for approximating a solution of the min-bisection problem
Recommended article: A branch-and-bound algorithm for concave network flow problems
Recommended article: A composite algorithm for a concave-cost network flow problem
Recommended article: Heuristic solutions for general concave minimum cost network flow problems
Recommended article: Q3626256
Recommended article: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
Recommended article: Q3626409
description: scientific article; zbMATH DE number 6169046