Using stratified sampling to solve the Knapsack problem

DOI10.1007/BF02911263zbMath0917.90261OpenAlexW1986339218MaRDI QIDQ1286279

N. Yu. Kuznetsov

Publication date: 3 May 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02911263

zbMATH Keywords

reliabilitytraveling salesmanknapsack problemstratified sampling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Applying fast simulation to find the number of good permutations

Cites Work

• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using stratified sampling to solve the Knapsack problem