On the complexity of recognizing a class of generalized networks

  • Authors:

  • Vijaya Chandru;Collette R Coullard;Donald K Wagner

  • Affiliations:

  • School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA;School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA;School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of determining whether a given linear programming problem can be converted to a generalized network flow problem having no unit-weight cycles is shown to be NP-hard. The same argument also shows that the problem of determining whether a gain matroid is bicircular is NP-hard.