Pages that link to "Item:Q4156111"
From MaRDI portal
The following pages link to Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems (Q4156111):
Displayed 14 items.
- Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Landscape-level optimization using tabu search and stand density-related forest management prescriptions (Q852999) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
- A computational evaluation of optimal solution value estimation procedures (Q1104245) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
- Uso del estadisticoD n de Kolmogorov-Smirnov en inferencia parametrica (Q3357335) (← links)
- (Q4212959) (← links)