A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
Published in Operations Research • Apr 1, 1984
NobleIDNI4P08W03R19S85
Authors:
Bruce Faaland
Abstract
We solve a simple class of linear programming problems with tree-structured constraint matrices. Our procedure separates the problem into a sequence of continuous knapsack problems, each of which requires linear time to solve, for total solution time no worse than proportional to the number of nonze...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!