Optimization on networks

  • Authors:

  • D. Binger

  • Affiliations:

  • -

  • Venue:
  • ACM SIGSAM Bulletin
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

The project is to use PROLOG to solve an optimization problem on a network. A brief introduction to networks includes the definitions necessary for the description of the optimal flow algorithm, which uses the painted network algorithm as a subroutine. An implementation of the painted network algorithm in PROLOG is given.