Point estimation of a global optimum for large combinatorial problems

DOI10.1080/03610917808812084MaRDI QIDQ4181801zbMATH OpenOpenAlexFDO

Authors Bruce 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 OptimizationEstimation of LocationParameterWeibull Distribution

Mathematics Subject Classification ID

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

Cites work

• A statistical approach to the tsp
• Approximate Traveling Salesman Algorithms
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3141621 (Why is no real title available?)
• scientific article; zbMATH DE number 3530858 (Why is no real title available?)
• scientific article; zbMATH DE number 3535592 (Why is no real title available?)
• Hyper‐efficient estimator of the location parameter of the weibull laws
• The Traveling Salesman Problem: A Survey

Cited in

(5)

• 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
• Curse of scale-freeness: intractability of large-scale optimization with multi-start methods

This page was built for publication: Point estimation of a global optimum for large combinatorial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181801)