A neurodynamic approach to zero-one quadratic programming
From MaRDI portal
Publication:2234482
DOI10.1007/s11075-021-01075-zzbMath1478.90074OpenAlexW3127141745MaRDI QIDQ2234482
Publication date: 19 October 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01075-z
Integer programming (90C10) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models
- A dynamic model to solve the absolute value equations
- An improved linearization technique for a class of quadratic 0-1 programming problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Penalty parameter for linearly constrained 0--1 quadratic programming
- A novel neural network for solving semidefinite programming problems with some applications
- Neurodynamical optimization
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- A neurodynamic optimization approach for complex-variables programming problem
- A collaborative neurodynamic approach to global and combinatorial optimization
- An interior point continuous path-following trajectory for linear programming
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- Nonlinear integer programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A continuous approch for globally solving linearly constrained quadratic
- A continuous method model for solving general variational inequality
- Lagrange programming neural networks
- Introduction to global optimization.
- Stability analysis of gradient-based neural networks for optimization problems
