D.Jensen,"Colouring and duality in combinatorial structures" Ph.D. Thesis, Cornell University, Itacha, New York, 1985.  Home/Search   Document Not in Database   Summary   Related Articles

....[31] method) is nite with the minimal index rule. An interesting early application of least index resolution occured in Murthy s [20] paper, which is a special case of Klafszky Terlaky s [16] criss cross method. A recursive algorithm, which is closely related to our recursive method and Jensen s [14] algorithm was published by Van der Heyden [32] Another related eld to LP and QP is the theory of oriented matroid (OM) programming. Several algorithms were proposed for OM LP; see Bland [5] Fukuda [12] Jensen [14] Terlaky [25] and Wang [34] These algorithms were applied for LP as well. ....

....algorithm, which is closely related to our recursive method and Jensen s [14] algorithm was published by Van der Heyden [32] Another related eld to LP and QP is the theory of oriented matroid (OM) programming. Several algorithms were proposed for OM LP; see Bland [5] Fukuda [12] Jensen [14], Terlaky [25] and Wang [34] These algorithms were applied for LP as well. The generalization of QP for OM QP was made by Morris and Todd [19, 28,29] Todd solved OM QP problems by generalizing Lemke s [18] method with lexicographic extensions. Recently Klafszky and Terlaky [16,17] ....

[Article contains additional citation context not shown here]

D.Jensen,"Colouring and duality in combinatorial structures" Ph.D. Thesis, Cornell University, Itacha, New York, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC