Matrix representation and gradient flows for NP-hard problems

DOI10.1007/BF02192047zbMath0843.90102OpenAlexW1995180452MaRDI QIDQ1906756

Yanyan Li

Publication date: 19 August 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192047

zbMATH Keywords

traveling salesmangradient flowlocal searchgraph partitioningassignment problemNP-hard combinatorial optimizationcontinuous flowsasymptotically stable critical pointsgradient flows on the special orthogonal group

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Metaheuristics: A bibliography ⋮ Continuous relaxations for the traveling salesman problem ⋮ Augmented gradient flows for on-line robust pole assignment via state and output feedback

Cites Work

• Unnamed Item
• Computational experience with an interior point algorithm on the satisfiability problem
• Hamiltonian group actions and integrable systems
• The QR algorithm and scattering for the finite nonperiodic Toda lattice
• How easy is local search?
• Least squares matching problems
• Hamiltonian structure of dynamical systems which solve linear programming problems
• An interior point algorithm to solve computationally difficult set covering problems
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• Ordinary Differential Equations and the Symmetric Eigenvalue Problem
• Simple Local Search Problems that are Hard to Solve
• On Rutishauser’s Approach to Self-Similar Flows
• On the Continuous Realization of Iterative Processes
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Dynamical Systems which Solve Optimization Problems with Linear Constraints

This page was built for publication: Matrix representation and gradient flows for NP-hard problems