Using Confidence Limits for the Global Optimum in Combinatorial Optimization

DOI10.1287/opre.33.5.1024zbMath0587.90070OpenAlexW2015483401MaRDI QIDQ3714898

Ulrich Derigs

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.5.1024

zbMATH Keywords

quadratic assignmentEuclidean travelling salesmancomputional studyconstruction of lower confidence limitsoptimal values of combinatorial minimizationWeibull approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (10)

On statistical bounds of heuristic solutions to location problems ⋮ A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ Best practices for comparing optimization algorithms ⋮ Parallel genetic algorithms with local search ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Heuristic solutions and confidence intervals for the multicovering problem ⋮ Using a hybrid of exact and genetic algorithms to design survivable networks ⋮ Confidence in heuristic solutions?

This page was built for publication: Using Confidence Limits for the Global Optimum in Combinatorial Optimization