Experimentation in optimization

DOI10.1016/S0377-2217(86)80002-9zbMath0605.90136OpenAlexW2063285353MaRDI QIDQ1084342

Edward A. Wasil, Edward Baker, Arjang A. Assad, Bruce L. Golden

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(86)80002-9

zbMATH Keywords

Statistical methodscomputational experiment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90C99)

Related Items (2)

Designing and reporting on computational experiments with heuristic methods ⋮ Comparison of the performance of modern heuristics for combinatorial optimization on real data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A decision-theoretic framework for comparing heuristics
• Nonlinear programming codes. Information, tests, performance
• Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
• A modular algorithm for an extended vehicle scheduling problem
• Test example for nonlinear programming codes
• What makes integer programming problems hard to solve: An empirical study
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Using simulated annealing to solve routing and location problems
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Technical Note—Shortest-Path Algorithms: A Comparison
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Computer Solutions of the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem
• Ordered Hypotheses for Multiple Treatments: A Significance Test for Linear Ranks
• Nonlinear programming on a microcomputer

This page was built for publication: Experimentation in optimization