𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Syntactic Proof of Cut-Elimination For GLlin

✍ Scribed by S. Valentini

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
288 KB
Volume
32
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A finiteness proof for modified dantzig
A finiteness proof for modified dantzig cuts in integer programming
✍ V. J. Bowman Jr.; G. L. Nemhauser πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 234 KB

where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex a

A Short Proof of Seymour's Characterizat
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
✍ Bertrand Guenin πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 113 KB

Seymour proved that the set of odd circuits of a signed binary matroid ðM; SÞ has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to ðMðK 4 Þ; EðK 4 ÞÞ: We give a shorter proof of this result. # 2002 Elsevier Science (USA)