New Directions in Network Flows

Abstract

A new, fast algorithm has been developed for the solution of problems using Lagrangian relaxation. This algorithm appears to improve running times by a factor of n-squared, where n is the number of variables.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 20, 1992
Accession Number
ADA250499

Entities

People

  • James B. Orlin

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Communication Networks
  • Communication Systems
  • Compression
  • Curve Fitting
  • Data Compression
  • Linear Programming
  • Materials
  • Mathematical Programming
  • Mathematics
  • Networks
  • Operations Research
  • Optimization
  • Project Management
  • Transportation