Graphic approach to combinatorial optimization

  • Authors:

  • A. A. Lazarev

  • Affiliations:

  • Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.