Minimum Cuts and Related Problems.

Abstract

The paper is concerned with an integer programming characterization of a cut in a network. This characterization provides a fundamental equivalence between directed pseudosummetric networks and undirected networks. It also identifies a class of problems which can be solved as minimum cut problems on a network. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1974
Accession Number
AD0780924

Entities

People

  • H. Donald Ratliff
  • Jean-claude Picard

Organizations

  • University of Florida

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Behavior And Behavior Mechanisms
  • Behavioral Disciplines And Activities
  • Behavioral Sciences
  • Computer Programming
  • Computing-Related Activities
  • Cooperation
  • Group Dynamics
  • Integer Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Psychology

Readers

  • Graph Algorithms and Convex Optimization.