| Record ID | ia:pivotingextensio0000unse |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/pivotingextensio0000unse/pivotingextensio0000unse_marc.xml |
| Download MARC binary | https://www.archive.org/download/pivotingextensio0000unse/pivotingextensio0000unse_meta.mrc |
LEADER: 01857cam a2200277 p 4500
001 74083270
003 DLC
005 20091111082435.0
008 750523s1974 ne c b 010 0 eng
010 $a 74083270
015 $aNe75-2
020 $a0444107274 (American Elsevier)
040 $aDLC$cDLC$dDLC
050 00 $aQA402.5$b.P56
082 00 $a519.7
245 00 $aPivoting and extensions :$bin honor of A. W. Tucker /$ced. by M. L. Balinski.
260 $aAmsterdam :$bNorth-Holland Pub. Co. ;$aNew York :$bAmerican Elsevier Pub. Co.,$c1974.
300 $avii, 205 p. :$bport. ;$c24 cm.
440 0 $aMathematical programming study ;$v1
504 $a"Bibliography of Albert William Tucker to July 1974": p. [4]-9.
504 $aIncludes bibliographies.
505 0 $aAdler, I. Lower bounds for maximum diameters of polytopes.--Adler, I. and Dantzig, G. B. Maximum diameter of abstract polytopes.--Adler, I., Dantzig, G. B., and Murty, K. G. Existence of A-avoiding paths in abstract polytopes.--Balinski, M. L. On two special classes of transportation polytopes.--Cottle, R. W. Solution rays for a class of complementarity problems.--Duffin, R. J. Fourier's analysis of linear inequality systems.--Eaves, B. C. Solving piecewise linear convex equations.--Fulkerson, D. R., Hoffman, A. J., and Oppenheim, R. On balanced matrices.--Griesmer, J. H. Derivation of a bound for error-correcting codes using pivoting techniques.--Kuhn, H. W. A new proof of the fundamental theorem of algebra.--Maurer, S. Pivotal theory of determinants.--Shapley, L. S. A note of the Lemke-Howson method.--Wolfe, P. Algorithm for a least-distance programming problem.
650 0 $aProgramming (Mathematics)
600 10 $aTucker, Albert W.$q(Albert William),$d1905-1995$vBibliography.
700 1 $aTucker, Albert W.$q(Albert William),$d1905-1995.
700 1 $aBalinski, M. L.