Point estimation of a global optimum for large combinatorial problems

DOI10.1080/03610917808812084zbMATH Open0398.62025OpenAlexW1981019287MaRDI QIDQ4181801FDOQ4181801

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 OptimizationParameterEstimation of LocationWeibull Distribution

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computer Solutions of the Traveling Salesman Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate Traveling Salesman Algorithms
• The Traveling Salesman Problem: A Survey
• A statistical approach to the tsp
• Hyper‐efficient estimator of the location parameter of the weibull laws

Cited In (4)

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

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)