Point estimation of a global optimum for large combinatorial problems

DOI10.1080/03610917808812084zbMath0398.62025OpenAlexW1981019287MaRDI QIDQ4181801

Bruce L. Golden

Publication date: 1978

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610917808812084

zbMATH Keywords

Combinatorial OptimizationParameterWeibull DistributionEstimation of Location

Mathematics Subject Classification ID

Point estimation (62F10) Numerical optimization and variational techniques (65K10)

Related Items

A computational evaluation of optimal solution value estimation procedures, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Interval estimation of a global optimum for large combinatorial problems, Dynamic allocation of uncertain supply for the perishable commodity supply chain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate Traveling Salesman Algorithms
• A statistical approach to the tsp
• Computer Solutions of the Traveling Salesman Problem
• Hyper‐efficient estimator of the location parameter of the weibull laws
• The Traveling Salesman Problem: A Survey