article

Guidelines for reporting results of computational experiments. Report of the ad hoc committee

Authors:

Richard H. Jackson,

Paul T. Boggs,

Stephen G. Nash,

Susan PowellAuthors Info & Claims

Mathematical Programming: Series A and B, Volume 49, Issue 1-3

Pages 413 - 425

Published: 01 November 1990 Publication History

Abstract

No abstract available.

References

[1]

J.C.P. Bus, "Performance measures for evaluating mathematical programming software," COAL Newsletter (Jan. 1980) 8.

Google Scholar

[2]

H.P. Crowder, R.S. Dembo and J.M. Mulvey, "On reporting computational experiments with mathematical software," ACM Transactions on Mathematical Software 5 (1979) 193-203.

Digital Library

Google Scholar

[3]

H.P. Crowder and P.B. Saunders, "Results of a survey on MP performance indicators," COAL Newsletter (Jan. 1980) 2-6.

Google Scholar

[4]

J.J. Dongarra, J.R. Bunch, C.B. Moler and G.W. Stewart, Linpack Users' Guide (SIAM Publications, Philadelphia, PA, 1979).

Google Scholar

[5]

J.J. Elam and D. Klingman, "NETGEN II: A system for generating structured network-based mathematical programming test problems," in: J.M. Mulvey, ed.,Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems No. 199 (Springer-Verlag, New York, 1982) pp. 16-23.

Google Scholar

[6]

D.M. Gay, "Algorithm 611. Subroutines for unconstrained minimization using a model/trust-region approach," ACM Transactions on Mathematical Software 9 (1983) 503-524.

Digital Library

Google Scholar

[7]

D.M. Gay, "Electronic mail distribution of linear programming test problems," COAL Newsletter 13 (Dec. 1985) 10-12.

Google Scholar

[8]

J. Gilsinn, K. Hoffman, R. Jackson, E. Leyendecker, P. Saunders and D. Shier, "Methodology and analysis for comparing discrete linear L1 approximation codes," Communications in Statistics 136 (1977) 399-413.

Crossref

Google Scholar

[9]

K.L. Hiebert, "An evaluation of mathematical software that solves nonlinear least squares problems," ACM Transactions on Mathematical Software 7 (1981) 1-16.

Digital Library

Google Scholar

[10]

K.L. Hiebert, "An evaluation of mathematical software that solves systems of nonlinear equations," ACM Transactions on Mathematical Software 8 (1982) 5-20.

Digital Library

Google Scholar

[11]

J.K. Ho and E. Loute, "Computational experience with advanced implementation of decomposition algorithms for linear programming," Mathematical Programming 27 (1983) 283-290.

Digital Library

Google Scholar

[12]

D.C. Hoaglin, V.C. Klema and S.C. Peters, "Exploratory data analysis in a study of the performance of nonlinear optimization routines," ACM Transactions on Mathematical Software 8 (1982) 145-162.

Digital Library

Google Scholar

[13]

W. Hoch and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems No. 187 (Springer-Verlag, New York, 1981).

Digital Library

Google Scholar

[14]

R. Hockney and C. Jesshope, Parallel Computers: Architecture, Programming and Algorithms (Adam Hilger, Bristol, 1981).

Google Scholar

[15]

A. Hoffman, M. Mannos, D. Sakolowsky and N. Wieymann, "Computational experience in solving linear programs," Journal of SIAM 1 (1953) 17-33.

Google Scholar

[16]

K.L. Hoffman and D.R. Shier, "A test problem generator for discrete linear L1 approximation problems," ACM Transactions on Mathematical Software 6 (1980) 587-593.

Digital Library

Google Scholar

[17]

K.L. Hoffman and R.H.F. Jackson, "In pursuit of a methodology for testing mathematical programming software," in: J.M. Mulvey, ed.,Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems No. 199 (Springer-Verlag, New York, 1982) pp. 177-199.

Google Scholar

[18]

R.H.F. Jackson and J.M. Mulvey, "A critical review of comparisons of mathematical programming algorithms and software (1953-1977)," Journal of Research of the National Bureau of Standards 83 (1978) 563-583.

Crossref

Google Scholar

[19]

D. Klingman, A. Napier and F. Stutz, "NETGEN: A program for generalizing large scale assignment, transportation, and minimum cost flow network problems," Management Science 20 (1974) 814-821.

Digital Library

Google Scholar

[20]

G. Lidor, "Construction of nonlinear programming test problems with known solution characteristics," in: J.M. Mulvey, ed.,Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems No. 199 (Springer-Verlag, New York, 1982) pp. 25-35.

Google Scholar

[21]

I. Lustig, "An analysis of an available set of linear programming test problems," Computers and Operations Research 16 (1989) 173-184.

Digital Library

Google Scholar

[22]

J.N. Lyness, "Performance profiles and software evaluation," Argonne National Laboratories TM 343 (Argonne, IL, 1979).

Google Scholar

[23]

J. May and R. Smith, "The definition and generalization of geometrically random linear constraint sets," in: J.M. Mulvey, ed.,Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems No. 199 (Springer-Verlag, New York, 1982) pp. 24-34.

Google Scholar

[24]

W.M. Michaels and R.P. O'Neill, "A mathematical programming generator: MPGENR," ACM Transactions on Mathematical Software 6 (1980) 31-40.

Digital Library

Google Scholar

[25]

A. Miele and S. Gonzales, "On the comparative evaluation of algorithms for mathematical programming problems," in: O. Mangasarian, R. Meyer, and S. Robinson, eds.,Nonlinear Programming Vol. 3 (New York, 1978) pp. 337-359.

Google Scholar

[26]

J.J. More, B.S. Garbow and K.E. Hillstrom, "Testing unconstrained optimization software," ACM Transactions on Mathematical Software 7 (1981) 17-41.

Digital Library

Google Scholar

[27]

R.P. O'Neill, "A comparison of real-world linear programs and their randomly generated analogs," in: J.M. Mulvey, ed.,Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems No. 199 (Springer-Verlag, New York, 1982) pp. 44-59.

Google Scholar

[28]

P.M. Pardalos, "Generation of large-scale quadratic programs for use as global optimization test problems," ACM Transactions on Mathematical Software 13 (1987) 133-137.

Digital Library

Google Scholar

[29]

J.B. Rosen, "Global minimization of a linearly constrained concave function by partition of the feasible region (Appendix B)," Technical Report 81-11, Computer Science Department, University of Minnesota (Minneapolis, MN, 1981).

Google Scholar

[30]

K. Schittkowski, "A numerical comparison of optimization software using randomly generated test problems," Rechenzentrum Preprint No. 43, University of Würzburg (W7uuml;rzburg, Germany, 1978).

Google Scholar

Cited By

View all

Berthold T(2013)Measuring the impact of primal heuristicsOperations Research Letters10.1016/j.orl.2013.08.00741:6(611-614)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.orl.2013.08.007
Pasupathy RHenderson SNicol DFujimoto R(2006)A testbed of simulation-optimization problemsProceedings of the 38th conference on Winter simulation10.5555/1218112.1218164(255-263)Online publication date: 3-Dec-2006
https://dl.acm.org/doi/10.5555/1218112.1218164
Rardin RUzsoy R(2001)Experimental Evaluation of Heuristic Optimization AlgorithmsJournal of Heuristics10.1023/A:10113191152307:3(261-304)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1023/A%3A1011319115230
Show More Cited By

Index Terms

Guidelines for reporting results of computational experiments. Report of the ad hoc committee

Recommendations

Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security
A weight-based clustering multicast routing protocol for mobile ad hoc networks

In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
Ad Hoc Networking

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Mathematical Programming: Series A and B

Mathematical Programming: Series A and B Volume 49, Issue 1-3

November 1990

413 pages

ISSN:0025-5610

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 November 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berthold T(2013)Measuring the impact of primal heuristicsOperations Research Letters10.1016/j.orl.2013.08.00741:6(611-614)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.orl.2013.08.007
Pasupathy RHenderson SNicol DFujimoto R(2006)A testbed of simulation-optimization problemsProceedings of the 38th conference on Winter simulation10.5555/1218112.1218164(255-263)Online publication date: 3-Dec-2006
https://dl.acm.org/doi/10.5555/1218112.1218164
Rardin RUzsoy R(2001)Experimental Evaluation of Heuristic Optimization AlgorithmsJournal of Heuristics10.1023/A:10113191152307:3(261-304)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1023/A%3A1011319115230
Gergel V(1997)A Global Optimization Algorithm for Multivariate Functionswith Lipschitzian First DerivativesJournal of Global Optimization10.1023/A:100829062989610:3(257-281)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1023/A%3A1008290629896
Crowl L(1994)How to Measure, Present, and Compare Parallel PerformanceIEEE Parallel & Distributed Technology: Systems & Technology10.1109/88.2818692:1(9-25)Online publication date: 1-Mar-1994
https://dl.acm.org/doi/10.1109/88.281869
Reilly C(1993)A comparison of alternative input models for synthetic optimization problemsProceedings of the 25th conference on Winter simulation10.1145/256563.256666(356-364)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1145/256563.256666

View Options

View options

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations

Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security

A weight-based clustering multicast routing protocol for mobile ad hoc networks

Ad Hoc Networking

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations