Pages that link to "Item:Q3714898"
From MaRDI portal
The following pages link to Using Confidence Limits for the Global Optimum in Combinatorial Optimization (Q3714898):
Displaying 10 items.
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- Parallel genetic algorithms with local search (Q1915976) (← links)
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
- A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem (Q2147056) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)