Name
Abstract | ||
|---|---|---|
Min algebra has been used (Cuninghame-Greem [2], Hoffman [3]) to obtain results in operations research and graph theory. It has previously been seen primarily as an efficient way to describe a system of minimum relations. In this note we develop an elimination scheme for inductively solving systems of min algebraic equations and then prove a theorem of the alternative which is closely related to one of the duality models described in [3]. This work was developed in relation to tag systems [1]. These results provide a first step toward broadening min algebra from a modeling scheme to a solution technique. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0166-218X(87)90057-6 | Discrete Applied Mathematics |
Keywords | Field | DocType |
min algebraic duality | Graph theory,Discrete mathematics,Combinatorics,Algebraic number,Algebraic equation,Duality (optimization),Mathematics | Journal |
Volume | Issue | ISSN |
16 | 1 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Crystal Llewellyn | 1 | 0 | 0.34 |