Hidden and Embedded Structure in Linear Programs.

Abstract

This report is a summary of work completed on AFOSR Grant AFOSR-82-0004. The summary begins with a listing of papers written followed by further descriptions of work completed as well as work in progress. Contents includes: A Simple Theorem on 3-Connectivity; A Composition for Perfect Graphs; The partial Order of a Polymatroid Extreme Point; Algorithms for Two Versions of Graph Realization and an Applicaton to Linear Programming (1983); A Note on Recognizing Path Matrices; and Packing and Covering by Integral Feasible Flows in Integral Supply-Demand Networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 30, 1983
Accession Number
ADA137773

Entities

People

  • R. E. Bixby

Organizations

  • Northwestern University

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Coverings
  • Evolutionary Algorithms
  • Heuristic Methods
  • Industrial Engineering
  • Integrals
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Optimization
  • Security
  • Simplex Method
  • West Germany

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research
  • Systems Analysis and Design