Experimentation in optimization
DOI10.1016/S0377-2217(86)80002-9zbMATH Open0605.90136OpenAlexW2063285353MaRDI QIDQ1084342FDOQ1084342
Authors: Bruce Golden, Arjang A. Assad, Edward Wasil, Edward Baker 
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
Recommendations
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90C99)
Cites Work
- Nonlinear programming codes. Information, tests, performance
- Optimization by simulated annealing
- Title not available (Why is that?)
- Test example for nonlinear programming codes
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Technical Note—Shortest-Path Algorithms: A Comparison
- Using simulated annealing to solve routing and location problems
- Ordered Hypotheses for Multiple Treatments: A Significance Test for Linear Ranks
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- A modular algorithm for an extended vehicle scheduling problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Title not available (Why is that?)
- A man-machine approach toward solving the traveling salesman problem
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A decision-theoretic framework for comparing heuristics
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- Title not available (Why is that?)
- Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
- What makes integer programming problems hard to solve: An empirical study
- Nonlinear programming on a microcomputer
Cited In (7)
- Mixed models for the analysis of optimization algorithms
- Planning optimization-simulation experiments
- Optimal experiments in the presence of a learning effect: a problem suggested by software production
- Comparison of the performance of modern heuristics for combinatorial optimization on real data
- On design and analysis of funnel testing experiments in webpage optimization
- Design and Analysis of Optimization Algorithms Using Computational Statistics
- Designing and reporting on computational experiments with heuristic methods
This page was built for publication: Experimentation in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084342)
