Accession Number:

AD0656471

Title:

CYCLES WITH MINIMUM AVERAGE LENGTH

Descriptive Note:

Technical rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

• Fillieres, Alain

Report Date:

1967-06-01

Pagination or Media Count:

22.0

Abstract:

Given a directed network whose arcs have lengths unrestricted in sign and which contains at least one cycle, an algorithm to find the minimum average length cycle length divided by its number of arcs is described. A direct application of this algorithm solves the problem of finding whether a directed graph contains a cycle with negative length.

Descriptors:

• *GRAPHICS
• *MAPPING(TRANSFORMATIONS)
• ALGORITHMS
• COSTS
• OPERATIONS RESEARCH
• OPTIMIZATION
• PERIODIC VARIATIONS

Subject Categories:

• Theoretical Mathematics
• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE