article

Free access

A Status Report on Computing Algorithms for Mathematical Programming

Author:

William W. WhiteAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 5, Issue 3

Pages 135 - 166

https://doi.org/10.1145/356619.356620

Published: 01 September 1973 Publication History

PDF eReader

References

[1]

AaAD1E, J. (Ed.). Nonhnear Programming, North-Holland, Amsterdam, The Netherlands, 1967.

Google Scholar

[2]

ABADIE, J. (Ed). Integer and Nonlinear Programm~ng, North-Holland, Amsterdam, The Netherlands, 1970.

Google Scholar

[3]

ABADIE, J., AND J. CARPENTER. "Generahzatlon of the Wolfe Reduced Gradmnt Method to the Case of Nonhnear Constraints" Opt:- mlzatlon, R. Fletcher (Ed.), Academic Press, New York, 1969

Google Scholar

[4]

ABADIE, J; AND J. GaI~ou. "Numerical Experiments with the GRG Method". Integer and Nonhnear Programming, J. Abadle, (Ed.), North-Holland, Amsterdam, The Netherlands, 1970.

Google Scholar

[5]

ANTHONISSE, J M., AND B. DORHOUT. "Numerical Methods of Mathematical Optimization "Management Science, Vol. 16, p. B-459.

Google Scholar

[6]

ANTHONISSE, J. M ; A~D B. DORHOUT. "Numerical Methods of Mathematical Optlmlsatlon--A Rejoinder." Management Science, Vol. 16, B-461.

Google Scholar

[7]

AP~ELGREN, L. "Computational Experience of a Vessel Scheduling Algorithm using Column Generatmn and Branch-and-Bound Techmques". Presented at the 7th Mathemat:cal Programming Symposium 1970, The Hague, The Netherlands, September, 1970.

Google Scholar

[8]

ARONOFSKV, J S (Ed). Progress m Operalions Research, Volume HI Wiley, New York, 1969.

Google Scholar

[9]

BALINSKI, M. L.; AND R. E. GOMORY. "A Primal Method for Assignment and Transportation Problems." Management Science, Vol. lO, pp 578-593.

Google Scholar

[10]

BALINSKI, M. L.; ^NI) K. SPXSLBERa. "Methods for Integer Programming: Algebraic, Combinatorial, and Enumerative," Progress m Operations Research, Vol. III, J. S. Aronofsky (Ed.), Wiley, New York, 1969.

Google Scholar

[11]

BARNETSON, P. Critical Path Planning, Newnes Books, England, 1968.

Google Scholar

[12]

BARTELS, R. H.; AND G. H. GOLUB. "The Simplex Method of Linear Programming Using LU Decomposition", Comm. ACM, 12, 5 (May 1969) pp. 266-268.

Crossref

Google Scholar

[13]

BEALE, E. M.L. "Numerical Methods". Nonhnear Programming, J. Abadie (Ed.), North- Holland, Amsterdam, The Netherlands, 1967.

Google Scholar

[14]

BEALE, E. M. L Mathematical Programming in Practice, Pitman, New York, 1968.

Google Scholar

[15]

BEALE, E. M. L. "Mathematical Programmmg: Algorithms," Progress ~n Operatwns Research, Vol. III, J. Aronofsky (Ed.), Wiley, New York, pp. 135-174.

Google Scholar

[16]

BEALE, E. M.L. "Sparseness in Linear Programmmg", Large Sparse Sets o} Linear Equatwns. J. K. Reid (Ed.), Academic Press, New York, 1971.

Google Scholar

[17]

BEALE, E. M. L ; any j. A. TOMLIN. "Special Facihtms in a General Mathematical Programmmg System for Non-Convex Problems Using Ordered Sets of Variables," Proc. 5th IFORS ConIerence J. Lawrence, (Ed.), Tawstock, London, 1970.

Google Scholar

[18]

BELLMAN, R. E. Dynamic Programming. Prmceton Umversity Press, Princeton, N J., 1957.

Crossref

Google Scholar

[19]

BENICHOU, M.; J. M. GAUTHIER, P. GIROI)ET, G. HENTGES, G. Rmmas, A~D O. VINCENT. "Exper:ments in Mixed Integer Linear Programmmg," Mathemat,cal Programming, Vol. 1, pp. 76-94, 1971.

Google Scholar

[20]

BO~ER, J S. "Mathematical Programming: Computer Systems." Progress in Operations Research, Vol. III, J. Aronofsky Wiley, New York, (Ed.), 1969, pp. 115-134.

Google Scholar

[21]

BRAY, T. A.; A~D C. WITZ~ALL "Algorithm 336, Netflow" Comm. ACM, 11, 9 (Sept. 1968) pp. 631-632.

Crossref

Google Scholar

[22]

BuzBY, B. "Techniques and Experience Solving Really Big Nonlinear Programs." NATO Conference on Large Scale Systems, Elsinor, Denmark, July 1971.

Google Scholar

[23]

Collected Algorithms o} th'e CACM ACM New York (updated bimonthly).

Google Scholar

[24]

COLVILLE, A. R. "A Comparative Study of Nonlinear Programming Codes." Proceedings o} the Princeton Symposium on Mathematical Programming, H W. Kuhn, (Ed.), Princeton University Press, 1970, pp. 487-501.

Google Scholar

[25]

COT~Lv., R. W "The Principal Pivoting Method of Quadratic Programming." Mathematics o} the Deciszon Sciences, G. B. Dantzlg and A. F. Veinott Jr (Eds). American Mathematical Socmty, Providence, R.I., 1968.

Google Scholar

[26]

DAKIN, R.J. "A Tree Search Algorithm for M~xed Integer Programming Problems." The Computer Journal, Vol. 8, 1965, pp. 250-255

Google Scholar

[27]

DANTZm, G B Linear Programming and ;Extenswns. Princeton University Press, Princeton, N.J, 1963.

Google Scholar

[28]

DANTZI6, G. B.; R. P. HARVEY; R. D. Mc- KNIGHT; AND S. S. SMITH. "Sparse Matrix Techmques in Two Mathematical Programming Codes." Sparse Matr,x Proceedings, R. A. Willoughby (Ed.), IBM, Yorktown Heights, N.Y.

Google Scholar

[29]

DANvzm, G. B.; AND R. M. VAN SLYKE. "Generalized Upper Bounding Techniques for Linear Programming." Journal o} System and Computer Sciences, 1, 3 (October 1967).

Google Scholar

[30]

vEBucNET, J., "How to Take into Account the Low Density of Matrices to Design a Mathematical Programming Package." Large Sparse Sets o} L~near Equations, A. K. Reid (Ed.), Academic Press, New York, 1971.

Google Scholar

[31]

DENNIS, J. B "A High-Speed Computer Technique for the Transportation Problem." JACM $, 2 (April 1958) pp. 132--153.

Crossref

Google Scholar

[32]

DREYFUS, S. E, "An Appraisal of Some Shortest-Path Algorithms" Operations Research, 17, 3 (1969).

Google Scholar

[33]

DZIELINSKI, B. P.; AND R. E. GOMOEY. "Optimal Programming of Lot Sizes, Inventory and Labor Allocations." Management Science, Vol. 11, 1965, pp 874-890.

Google Scholar

[34]

FEUF.~, A. "Review of I-Ilmmelblau's Apphed Nonlinear Programming." Operations Research, 21, (January-February 1973), pp. 396-397.

Google Scholar

[35]

FIAcco, A. V., any G. P. McCoRMICK. "Computahonal Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming." Management Science, 10, 4 (1964), pp. 601-617.

Google Scholar

[36]

FLETCHEn, R. (Ed.). Optzm~zat~on. Academic Press, New York, 1969.

Google Scholar

[37]

FLETCHER, R., AND M J. D. POWELL. "A Rapidly Convergent Descent Method for Minimization." Computer Journal, Vol. 6, pp. 163-- 168.

Google Scholar

[38]

FORD. L R., AND D. R. FULKERSON. Flows in Networks. Plmceton University Press, Princeton, N.J., 1963.

Google Scholar

[39]

FORREST, J. J. H.; AND J. A. TOMLIN, "Updating Triangular Factors of the Basis to Maintain Sparsity in the Product Form Simplex Method." Mathematical Programmzng, 2, 3 (1972), pp. 263-278.

Google Scholar

[40]

FoR~.s~, J. J. H.; J. P. H Hms~; AND J. A. TOMLIN "Practical Solutions of Large and Complex Integer Programming Problems with UMPIRE." Management Science, to appear.

Google Scholar

[41]

GAss, S. I. Linear Programming. McGraw- Hill, New York, 1969.

Google Scholar

[42]

GEOFFRIOS, A. M. "Recent Computational Experience with Three Classes of Integer Linear Programs." Working Paper P-3699, The RAND Corporation, Santa Monica, Calif., October, 1967

Google Scholar

[43]

GEOFFaION, A. M. "Elements of Large-Scale Mathematical Programming, Parts I and II." Management Science, 16, 11 (July 1970).

Google Scholar

[44]

GILL, P. E.; AND W. MURItAY, "A Numerically Stable Form of The Simplex Algorithm." Department of Numerical Analysis and Mathematics Report Number 87, Natmnal Physical Laboratory, Teddington, M~ddlesex, England, 1970.

Google Scholar

[45]

GILL, P. E.; ^m) W. MVRRAY. "Two Methods for the Solution of Linearly Constrained and Unconstrained Optimlzahon Problems." Divmmn of Numerical Analysis and Computing Report NAC 25, National Physical Laboratory, Teddington, Middlesex, England, 1972.

Google Scholar

[46]

GILMORE, P. C.; AND R. E. GOMORY. "A Linear Programming Approach to the Cutting Stock Problem." Part I, Operatwns Research, Volume 9, pp. 849--859; Part Ii, Operations Research, Volume 11, pp. 863-887, 1963.

Google Scholar

[47]

GOLDFARB, D.; AND L. LAPIDUS, "Conjugate Gradient Method for Nonlinear Programming Problems with Linear Constraints." Ind. Eng. Chem. Fundamentals, Vol 7, 1968, pp. 142ff.

Google Scholar

[48]

GOMORY, R.E. "Some Polyhedra Related to Combinatorial Problems." Linear Algebra and its Apphcations, Vol. 2, 1969, pp. 451-558.

Google Scholar

[49]

GOMORY, R. E.; AND E. L JOHNSON, "Some Continuous Functions Related to Corner Polyhedra, I." Mathematwal Programming, Volume 3, 1972, pp. 23-86.

Google Scholar

[50]

GOMORY, R. E, AND E. L. JOHNSON, "Some " Continuous Functions Related to Corner Polyhedra, II," Mathematical Programming, Volume 3, 1972, pp. 359-389.

Google Scholar

[51]

GORRY, G. A.; AND J. F. SHAPIRO. "An Adaptive Group Theoretic Algorithm for Integer Programming Problems," Management Science, 17, 5 (January 1971).

Google Scholar

[52]

GRAVES, R. L.; AND P. WOL~S (Eds.). Recent Advances in Mathematzcal Programming. Mc- Graw-Hill, New York, 1963.

Google Scholar

[53]

GRIFFITH, R. E; AND R. A. STEW~T. "A Nonlinear Programming Technique for the Optimization of Continuous Processing System." Management Science, 7, 4 (July 1961), pp 379-392.

Google Scholar

[54]

GRmORIADIS, M. D., "Unified Pivoting Procedures for Large Structured Linear Systems and Programs " Decomposition o} Large-Scale Problems D. M. Himmelblau (Ed), North- Holland, Amsterdam, The Netherlands, 1973.

Google Scholar

[55]

GI~I(}ORIADIS, M. D, AND W. F. WALKER. "A Treatment of Transportation Problems by Primal Partition Programming." Management Science, 14, 9 (1968).

Google Scholar

[56]

GRIGORIADIS, M. D, L. PAPAYANOPOULOS, AND K. SPIELBER(L "Experimental Implementations of Mixed Integer Programming Algorithms." ACM National Conference, Chicago, Illinois, August 1971.

Crossref

Google Scholar

[57]

HADLEY, G. Linear Programming. Addison- Wesley, Reading, Mass, 1962.

Google Scholar

[58]

H^LLENE, D, "PTMZATN-Taking the I/O Out of Optimization" Proceedings o.f,SHARE 88, San Francisco, Calif., March, 1972.

Google Scholar

[59]

HANSEN, T.; ant) H SCARF. The Computaappear, Fall 1973.

Google Scholar

[60]

HARRIS, P M.J. "Pivot Selection Methods of the DEVEX L.P. Code" British Petroleum Co. London, England, 1972.

Google Scholar

[61]

HELLERMAN, E.; AND D. RARICK. "Reinversion with the Preassigned Pivot Procedure." Mathematical Programming, 1, 2 (1971), pp. 195-216

Google Scholar

[62]

HELLERMAN, E., AND D. RARICK. "The Partitioned Preassigned Pivot Procedure (P4)." Sparse Matrices and Their Apphcation. D. J. Rose and R. A Willoughby (Eds.), Plenum Press, N.Y.

Google Scholar

[63]

HIMMELBLAU, D.M. Applied Nonhnear Programm~ng, McGraw-Hill, New York, 1972.

Google Scholar

[64]

HIRSHFELD, D M. "Mathematical Programmmg Development at Management Science System, Inc." Proceedings of SHARE 88, San Francisco, Calif., March, 1972.

Google Scholar

[65]

JOHNSON, E. L.; AND K SPIELBERG. Inequalitires in Branch and Bound Programming." Report RC 3649, IBM Research, Yorktown Heights, New York, December, 1971.

Google Scholar

[66]

KA~I~, j. E. "Aspects of Large-Scale In- Core Linear Programming." Proceedings o} the 1971 Annual Conlerence o} the ACM, Chicago, Ill., August 3-5, 1971, pp. 304-313

Crossref

Google Scholar

[67]

KuNzI, H. P.; TZSCHACH; H. G. AND C. A. ZEHNDER. Numerical Methods o} Mathematical Optzmization. Academic Press, New York, 1968.

Google Scholar

[68]

KuNzI, H. P., TZSCHACH, H. G., A~D C A ZEHNDER. "Numerical Methods of MathemaUcal Optimlzatlon--A Reply." Management Science, 16, 3 (April, 1970).

Google Scholar

[69]

KuNzI, H. P., TZSCHACH, H. G, AND C. A ZEHNDER Numerzcal Methods o} Mathematical Optzmizatwn wzth Algol and Fortran Programs, Corrected and Augmented Version, Academic Press, N.Y., 1971.

Crossref

Google Scholar

[70]

LAGEMANN, J. S. "A Method for Solvmg the Transportation Problem " Naval Research Logistws Quarterly, 14, 1, (March 1967).

Google Scholar

[71]

LAND, A. H.; AND G. MORTON. "An Inverse- Basis Method for Beale's Quadratic Programming Algorithm," Management Sczence, 19, 5, (January 1973), pp. 510-516

Google Scholar

[72]

LARSON, L. J "A Modified Inversion Procedure for Product Form of Inverse in Linear Programming Codes" Comm. ACM Vol. 5, 1962, pp 382-383.

Crossref

Google Scholar

[73]

LASDON, L.S. Optimization Theory }or Large Systems, The Macmillan Company, New York, 1970.

Google Scholar

[74]

MANGA.SARIAN, O., Nonlinear Programming, McGraw-Hill, New York, 1969

Google Scholar

[75]

MERRILL, O. H. "Application and Extensions of an Algorithm that Computes Fixed Points of Certain Non-empty Convex Upper Semi-continuous Point to Set Mappings." Report 71-7, Dept. of Industrial Engineering, University of Michigan, Ann Arbor, Mich, September 1971.

Google Scholar

[76]

MmLER, C.E. "The Simplex Method for Local Separable Programming." Recent Advances in Mathematzcal Programming. R. L. Graves and P. Wolfe (Eds.), McGraw-Hill, New York, 1963.

Google Scholar

[77]

MODER, J. J.; AND C. R. PHILLIPS, Project Management w~th CPM and PERT, Reinhold, New York, 1964

Google Scholar

[78]

MURTAGH, B A.; AND R. W. H. SARGENT. "A Constrained Minimization Method with Quadratic Convergence "

Google Scholar

[79]

ORCHARD-HAYs, W. Advanced Linear Programmmg Computing Techniques. McGraw- Hill, New York, 1968.

Google Scholar

[80]

ORCHARD-HAYS, W. "Program Development at Management Science Systems, Inc," Proceedmgs o} Share 84, Denver, Colo. March 1970.

Google Scholar

[81]

PEARSON, J. D. "Variable Metric Methods of Minimization." Brit. Computer J., Vol. 12, 1969, pp. 171-178.

Google Scholar

[82]

POLAK, E. Computatzonal Methods in Optimization. Academic Press, New York, 1971.

Google Scholar

[83]

POWELL, M. J.D. "An Efficient Method for Finding the Minimum of a Function of Several Variables Without Calculating Derivatives." Computer Journal, Vol. 7, pp. 155-162

Google Scholar

[84]

PRABHAKAR, T "Operation of a Large Nonlinear Production and Distribution Planning Model." Nonlinear Programming Symposium, George Washington University, Washington, D.C., March 14-16, 1973.

Google Scholar

[85]

Proceedings o} SHARE 8~, held in Denver, Colorado, March, 1970.

Google Scholar

[86]

REID, J. K., (Ed.). Large Sparse Sets o} L~near Equations. Academic Press, New York, 1971.

Google Scholar

[87]

RosE, D J., ^~D R. A WmI~UGHBY (Eds.). Sparse Matrices and Thezr Applications, Plenum Press, New York, 1972.

Google Scholar

[88]

RUSIN, M. H. "A Revised Simplex Method for Quadratic Programming" SIAM Journal, 20, 2 (March 1971), pp. 143-160.

Google Scholar

[89]

SAV~DERS, J. "Large-Scale Linear Programmmg Using the Cholesky Factorizatlon" STAN-CS-72-252, Computer Science Department, Stanford University, Stanford, Cahf, January, 1972

Google Scholar

[90]

SmMAP Newsletter, Nos. 10, 11, 12, 13, ACM, New York, 1971-1973.

Google Scholar

[91]

SMITH, D. M. ; AND W ORCHARD-HAYs "Computational Efficiency in Product Form LP Codes." Recent Advances in Mathematical Programm~ug, R. L. Graves and P Wolfe (Eds), McGraw-Hill, New York.

Google Scholar

[92]

STAHA, R. S, AND D. M. HIMMELBLAU, "An Evaluation of Nonlinear Programming Techniques for Problems with Nonlinear Constraints" Nonlinear Programming Symposium, George Washington University, Washington, D C., March 14-16, 1973.

Google Scholar

[93]

TOMLIN, J. A. "Maintaining a Sparse Inverse m the Simplex Method" Technical Report No. 70-16, Operations Research House, Stanford University, Stanford, California, November 1970.

Google Scholar

[94]

TOMLIN, J. A, "Modifying Triangular Factors of the Basis in the Simplex Method", Sparse Matrices and Their Applications, D. J Rose and R A Willoughby, (Eds.), Plenum Press, New York.

Google Scholar

[95]

TOMLIN, J. A, "Survey of Computational Methods for Solving Large Scale Systems", Report 72-25, Operations Research Department, Stanford University, Stanford, Calif., October 1972.

Google Scholar

[96]

TOMLIN, J. A, "Pivoting for Sparsity and Size in Linear Programming Inversion Routines " J Inst. Math Appl., to appear.

Google Scholar

[97]

WILLOUGHBY, R. A. (Ed) "Sparse Matrix Proceedings." Report RA1 ($11707), Thomas J Watson Research Center, IBM Corporatmn, Yorktown Heights, New York, March, 1969.

Google Scholar

[98]

WOLFE, P. "Methods of Nonhnear Programming" Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe (Eds), McGraw-Hill, New York, 1963.

Google Scholar

[99]

WOt~F~, P. "The Composite Simplex Method." SIAM Review, Vol. 7, pp 42--54.

Google Scholar

[100]

WOLFE, P. "Trends m Linear Programming Computation." Sparse Matrtx Proceedings, R. A. Willoughby (Ed.), IBM, Yorktown Heights, N.Y., 1969.

Google Scholar

[101]

WOLFE, P. Quoted in Preface, in Opt~mizatwn, R. Fletcher (Ed), Academic Press, New York, 1969.

Google Scholar

[102]

WOLFE, P, AND L. CUTLER. "Experiments in Linear Programming," Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe (Eds.), McGraw-Hill, New York, 1969.

Google Scholar

Cited By

View all

Beale E(2009)The current algorithmic scope of mathematical programming systemsComputational Practice in Mathematical Programming10.1007/BFb0120707(1-11)Online publication date: 23-Feb-2009
https://doi.org/10.1007/BFb0120707
Helgaso RKennington J(2006)A note on splitting the bump in an elimination factorizationNaval Research Logistics Quarterly10.1002/nav.380029011529:1(169-178)Online publication date: 21-Nov-2006
https://doi.org/10.1002/nav.3800290115
Kolman BBeck R(1995)Further Topics in Linear ProgrammingElementary Linear Programming with Applications10.1016/B978-012417910-3/50006-1(155-247)Online publication date: 1995
https://doi.org/10.1016/B978-012417910-3/50006-1
Show More Cited By

Recommendations

Analysis of Overall Assignment and Sorting of Tasks in Heterogeneous Computing Systems Based on Mathematical Programming Algorithms
Abstract
The problem of assignment and sequencing of tasks is a very complex problem, which is related to whether the computer system can effectively exert the overall efficiency. Solving this problem can make the lowest cost and obtain the greatest ...
Using Mathematical Modeling in Provisioning a Heterogeneous Cloud Computing Environment

Cloud computing has emerged as a highly cost-effective computation paradigm for IT enterprise applications, scientific computing, and personal data management. Because cloud services are provided by machines of various capabilities, performance, power, ...
Mathematical programming
Encyclopedia of Computer Science

This article provides an overview of mathematical programming--its scope, its methods, and the associated computer feasibility and efficacy of the methods. Mathematical programming as discussed here has nothing inherently to do with computer ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 5, Issue 3

Sept. 1973

64 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356619

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1973

Published in CSUR Volume 5, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
1,044
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)16

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beale E(2009)The current algorithmic scope of mathematical programming systemsComputational Practice in Mathematical Programming10.1007/BFb0120707(1-11)Online publication date: 23-Feb-2009
https://doi.org/10.1007/BFb0120707
Helgaso RKennington J(2006)A note on splitting the bump in an elimination factorizationNaval Research Logistics Quarterly10.1002/nav.380029011529:1(169-178)Online publication date: 21-Nov-2006
https://doi.org/10.1002/nav.3800290115
Kolman BBeck R(1995)Further Topics in Linear ProgrammingElementary Linear Programming with Applications10.1016/B978-012417910-3/50006-1(155-247)Online publication date: 1995
https://doi.org/10.1016/B978-012417910-3/50006-1
Littger KLittger K(1992)Auswahl von DV-bezogenen VeröffentlichungenOptimierung10.1007/978-3-642-87729-2_10(241-249)Online publication date: 1992
https://doi.org/10.1007/978-3-642-87729-2_10
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Michaels WO'Neill R(1980)A Mathematical Program Generator MPGENRACM Transactions on Mathematical Software10.1145/355873.3558766:1(31-44)Online publication date: 1-Mar-1980
https://dl.acm.org/doi/10.1145/355873.355876
KOLMAN BBECK R(1980)FURTHER TOPICS IN LINEAR PROGRAMMINGElementary Linear Programming with Applications10.1016/B978-0-12-417860-1.50011-2(143-226)Online publication date: 1980
https://doi.org/10.1016/B978-0-12-417860-1.50011-2
Molina F(1979)A Survey of Resource Directive Decomposition in Mathematical ProgrammingACM Computing Surveys10.1145/356770.35677411:2(95-104)Online publication date: 1-Jun-1979
https://dl.acm.org/doi/10.1145/356770.356774
Rice JGear COrtega JParlett BSchultz MShampine LWolfe PTraub J(1979)Numerical computationsACM SIGNUM Newsletter10.1145/1057517.105751814:si-1(1-48)Online publication date: 1-Feb-1979
https://dl.acm.org/doi/10.1145/1057517.1057518
THESEN A(1978)LINEAR PROGRAMMING METHODSComputer Methods in Operations Research10.1016/B978-0-12-686150-1.50012-0(139-170)Online publication date: 1978
https://doi.org/10.1016/B978-0-12-686150-1.50012-0
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Analysis of Overall Assignment and Sorting of Tasks in Heterogeneous Computing Systems Based on Mathematical Programming Algorithms

Using Mathematical Modeling in Provisioning a Heterogeneous Cloud Computing Environment

Mathematical programming

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations