Interval estimation of a global optimum for large combinatorial problems
From MaRDI portal
Cites work
- A man-machine approach toward solving the traveling salesman problem
- Computer Solutions of the Traveling Salesman Problem
- Estimation of a truncation point
- scientific article; zbMATH DE number 3141621 (Why is no real title available?)
- scientific article; zbMATH DE number 3304538 (Why is no real title available?)
- Point estimation of a global optimum for large combinatorial problems
Cited in
(25)- Randomized algorithms in combinatorial optimization: A survey
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- Tactical design of rail freight networks. II: Local search methods with statistical analysis
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Heuristic methods and applications: A categorized survey
- Parallel genetic algorithms with local search
- 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
- Using regression models to understand the impact of route-length variability in practical vehicle routing
- On statistical bounds of heuristic solutions to location problems
- Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
- Optimal path planning of mobile robots for sample collection
- A review of maximum likelihood estimation methods for the three-parameter weibull distribution
- Bayesian nonparametrie inference and monte carlo optimization
- Dynamic allocation of uncertain supply for the perishable commodity supply chain
- Heuristic solutions and confidence intervals for the multicovering problem
- Using a hybrid of exact and genetic algorithms to design survivable networks
- On the Weibull cost estimation of building frames designed by simulated annealing
- Curse of scale-freeness: intractability of large-scale optimization with multi-start methods
- Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
- Confidence in heuristic solutions?
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- Landscape-level optimization using tabu search and stand density-related forest management prescriptions
This page was built for publication: Interval 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 Q4181638)
