An Efficient Algorithm for Solving a Special Class of LP's
Kern, Walter
(1986)
An Efficient Algorithm for Solving a Special Class of LP's.
Published in:
Computing : archives for scientific computing Vol. 37 (3).
pp. 219226.
Abstract
We consider LP's of the form max{ cxvert ell le Axle b, Lle xle U} where l,b,L,U are nonnegative and A is a 01 matrix which looks like ''Manhattan Skyline'í.e. the support of each row is contained in the support of every subsequent row. An O(nm+n log n) algorithm is presented for solving the problem.
Actions:
Content information:
Item Type:  Article 

Citations:  No citation data. 
Uncontrolled Keywords:  0/1matrix Manhattan Skyline matrix 
Subjects: 

Divisions:  Mathematical Institute 
Related URLs: 
Deposit Information:
ZAIK Number:  zpr85016 

Depositing User:  Archive Admin 
Date Deposited:  02 Apr 2001 00:00 
Last Modified:  25 Oct 2011 09:20 
URI:  http://earchive.informatik.unikoeln.de/id/eprint/16 