Solving combinatorial optimization problems by gradient flows

Wing Shing Wong

doi:10.1109/cdc.1992.371166

ScienceGate Book Chapters

JOURNAL ARTICLE

Solving combinatorial optimization problems by gradient flows

Wing Shing Wong

Year: 2005 Vol: 11 Pages: 1494-1496

DOI: 10.1109/cdc.1992.371166

Get Full-Text PDF Get Analytical Report

Abstract

The relationship between certain NP-hard combinatorial optimization problems and gradient flows on the special orthogonal group is examined. It is shown that there is a correspondence between the local minima of a heuristic local search algorithm and the local minima of the gradient flow on the group.< >

Keywords:

Maxima and minima Heuristic Combinatorial optimization Mathematical optimization Balanced flow Flow (mathematics) Computer science Local search (optimization) Combinatorics Mathematics Algorithm Mathematical analysis Geometry

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.22

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Solving combinatorial optimization problems by gradient flows

Abstract

Metrics

Topics

Related Documents

Solving Combinatorial Optimization Problems

On solving combinatorial optimization problems

Solving Combinatorial Optimization Problems in Parallel

Solving combinatorial optimization problems using Karmarkar's algorithm

Solving Combinatorial Optimization Problems with Fuzzy Weights