Point estimation of a global optimum for large combinatorial problems
From MaRDI portal
Publication:4181801
Cites work
- 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?)
- A statistical approach to the tsp
- Approximate Traveling Salesman Algorithms
- Computer Solutions of the Traveling Salesman Problem
- Hyper‐efficient estimator of the location parameter of the weibull laws
- The Traveling Salesman Problem: A Survey
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)