Integer Networks with Side Constraints: Algorithms and Applications

Abstract

Many of the routing and scheduling problems which arise at the Air Mobility Command can be modelled as constrained integer networks. The network part is associated with the routing and distribution network flown by the Command and the side constraints a rise when that aircraft capacity must be shared by different commodities or some type of budget restriction must be enforced. The work presented here reports on the progress in solving this type of mathematical program

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 18, 1994
Accession Number
ADA285051

Entities

People

  • Jeffery L. Kennington

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Air Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Classification
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Engineering
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Plastic Explosives
  • Recovery
  • Scientific Research
  • Security

Readers

  • Computer Networking
  • Operations Research