Blocking and Anti-Blocking Pairs of Polyhedra

Abstract

Some of the main notions and theorems about blocking pairs of polyhedra and anti-blocking pairs of polyhedra are described. The two geometric duality theories conform in many respects, but there are certain important differences. Applications to various combinatorial extremum problems are discussed, and some classes of blocking and anti-blocking pairs that have been explicitly determined are mentioned.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1970
Accession Number
AD0721270

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Analogs
  • Computer Programming
  • Construction
  • Corporations
  • Coverings
  • Graph Theory
  • Heuristic Methods
  • Inequalities
  • Linear Programming
  • Permutations
  • Terminals

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.