A computational evaluation of optimal solution value estimation procedures

DOI10.1016/0305-0548(88)90059-7zbMath0646.90069OpenAlexW2020145858MaRDI QIDQ1104245

Howard J. Weiss, Robert L. jun. Nydick

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90059-7

zbMATH Keywords

heuristicslarge scale optimizationoptimal solution value estimation procedures

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Related Items (2)

On statistical bounds of heuristic solutions to location problems ⋮ Confidence in heuristic solutions?

Cites Work

• Unnamed Item
• Unnamed Item
• NOTES ON BIAS IN ESTIMATION
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Pivot and Complement–A Heuristic for 0-1 Programming
• A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• Algoristics for Single-Machine Sequencing with Precedence Constraints
• Point estimation of a global optimum for large combinatorial problems
• A statistical approach to the tsp
• Statistical inference for bounds of random variables
• Estimation of a truncation point
• A Search Model for Evaluating Combinatorially Explosive Problems

This page was built for publication: A computational evaluation of optimal solution value estimation procedures