A capable neural network model for solving the maximum flow problem
DOI10.1016/J.CAM.2012.03.001zbMATH Open1239.90015OpenAlexW2045395686MaRDI QIDQ425347FDOQ425347
Authors: Alireza Nazemi, Farahnaz Omidi
Publication date: 8 June 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.03.001
Recommendations
Quadratic programming (90C20) Deterministic network models in operations research (90B10) Neural networks for/in biological studies, artificial life and related topics (92B20) Stability of topological dynamical systems (37B25)
Cites Work
- Title not available (Why is that?)
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Title not available (Why is that?)
- A capacity scaling algorithm for the constrained maximum flow problem
- Title not available (Why is that?)
- Neural network models and its application for solving linear and quadratic programming problems
- Application of projection neural network in solving convex programming problems
- A dynamic system model for solving convex nonlinear optimization problems
- A dynamical model for solving degenerate quadratic minimax problems with constraints
- A feedback neural network for solving convex constraint optimization problems
- Generalized neural networks for spectral analysis: dynamics and Liapunov functions
- A simple and high performance neural network for quadratic programming problems.
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A nonlinear projection neural network for solving interval quadratic programming problems and its stability analysis
- A new class of interval projection neural networks for solving interval quadratic program
- Increasing the capacity of a network: the parametric budget problem
- On a capacity scaling algorithm for the constrained maximum flow problem
- A specialized network simplex algorithm for the constrained maximum flow problem
- Neural network models for solving the maximum flow problem
- A constrained maximum flow problem†
- A double scaling algorithm for the constrained maximum flow problem
Cited In (6)
- Neural network models for solving the maximum flow problem
- A practical nonlinear dynamic framework for solving a class of fractional programming problems
- A computational intelligence method for solving a class of portfolio optimization problems
- ReLU neural networks of polynomial size for exact maximum flow computation
- Nonlinear fractional optimal control problems with neural network and dynamic optimization schemes
- An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models
This page was built for publication: A capable neural network model for solving the maximum flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425347)