A deterministic annealing algorithm for the minimum concave cost network flow problem

DOI10.1016/j.neunet.2011.03.018zbMath1294.90066OpenAlexW2053699133WikidataQ51580018 ScholiaQ51580018MaRDI QIDQ1952548

Yabin Sun, Yang Yang, Yuping Wang, Chuangyin Dang

Publication date: 31 May 2013

Published in: Neural Networks (Search for Journal in Brave)

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

zbMATH Keywords

Lagrange multipliercombinatorial optimizationiterative methodnetwork flowdeterministic annealingbarrier functiondescent directionconcave costLagrange and barrier function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ An approximation algorithm for graph partitioning via deterministic annealing neural network ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project ⋮ Solving the production transportation problem via a deterministic annealing neural network method ⋮ The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New cooperative projection neural network for nonlinearly constrained variational inequality
• Bisecting a 4-connected graph with three resource sets
• Network flow problems and permutationally concave games
• ``Neural computation of decisions in optimization problems
• Constrained global optimization: algorithms and applications
• A neural network algorithm for the multiple traveling salesman problem
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• A branch-and-bound algorithm for concave network flow problems
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• A new neural network for solving nonlinear projection equations
• A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem
• Heuristic solutions for general concave minimum cost network flow problems
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• An Extended Projection Neural Network for Constrained Optimization
• A Polylogarithmic Approximation of the Minimum Bisection

This page was built for publication: A deterministic annealing algorithm for the minimum concave cost network flow problem