About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Greedy packing and series-parallel graphs
Abstract
We characterize nonnegative matrices A with the following property: for every a ≧ 0, the linear programming problem max(1, y), where Ay ≦ 0, y ≧ 0, is solved by successively maximizing the variables in arbitrary order. The concept of series-parallel graphs is central to the characterization. © 1988.