Richard D. McBride

Learn More
If a linear program tLP) po ssesses a large generalized network (G N) submatrix, this structure can be exploited to decrease solution time. The problems of finding maximum sets of GN constraint s and finding maximum embedded GN sub matrices are shown to be NP-complete, indicating that reliable, efficient solution of these problems is difficult. Therefore,(More)
  • 1