Interval estimation of a global optimum for large combinatorial problems

DOI10.1002/nav.3800260108zbMath0397.90100OpenAlexW2076892394MaRDI QIDQ4181638

Frank B. Alt, Bruce L. Golden

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260108

zbMATH Keywords

Interval EstimationComputational ExperienceLarge Combinatorial Problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Mathematical programming (90C99)

Related Items

Randomized algorithms in combinatorial optimization: A survey ⋮ On statistical bounds of heuristic solutions to location problems ⋮ Bin packing problems in one dimension: Heuristic solutions and confidence intervals ⋮ Landscape-level optimization using tabu search and stand density-related forest management prescriptions ⋮ A review of maximum likelihood estimation methods for the three-parameter weibull distribution ⋮ Parallel genetic algorithms with local search ⋮ On the Weibull cost estimation of building frames designed by simulated annealing ⋮ Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study ⋮ Using regression models to understand the impact of route-length variability in practical vehicle routing ⋮ Bayesian nonparametrie inference and monte carlo optimization ⋮ 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 ⋮ On estimating the distribution of optimal traveling salesman tour lengths using heuristics ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem ⋮ Heuristic solutions and confidence intervals for the multicovering problem ⋮ Using a hybrid of exact and genetic algorithms to design survivable networks ⋮ Optimal path planning of mobile robots for sample collection ⋮ Confidence in heuristic solutions? ⋮ Tactical design of rail freight networks. II: Local search methods with statistical analysis ⋮ Heuristic methods and applications: A categorized survey ⋮ Dynamic allocation of uncertain supply for the perishable commodity supply chain ⋮ On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem ⋮ A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Point estimation of a global optimum for large combinatorial problems
• Computer Solutions of the Traveling Salesman Problem
• Estimation of a truncation point
• A man-machine approach toward solving the traveling salesman problem