✦ LIBER ✦

An O(n2) simplex algorithm for a class of linear programs with tree structure

✍ Scribed by H. Schreck; G. Tinhofer

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 779 KB
Volume: 21
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(85)90034-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB

An analog of Karmarkar's algorithm for i

An analog of Karmarkar's algorithm for inequality constrained linear programs, with a ‘new’ class of projective transformations for centering a polytope

✍ Robert M Freund 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 491 KB

An O(n2) Divide-and-Conquer Algorithm fo

An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs

✍ A. Ehrenfeucht; H.N. Gabow; R.M. Mcconnell; S.J. Sullivan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 526 KB

This paper presents a simple divide-and-conquer algorithm for computing the prime tree decomposition of a two-structure. The algorithm runs in \(O\left(n^{2}\right)\) time, when \(n\) is the number of nodes of the two-structure. A directed or undirected graph is a special case of a two-structure, an