Using stratified sampling to solve the Knapsack problem

DOI10.1007/BF02911263MaRDI QIDQ1286279zbMATH OpenOpenAlexFDO

Authors 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

reliabilityknapsack problemstratified samplingtraveling salesman

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Solving the 0-1 proportional knapsack problem by sampling
• Integer solution to the allocation problem in stratified sampling
• Integer solution to the allocation problems in multivariate stratified sampling
• Nonlinear integer programming for optimal allocation in stratified sampling
• Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
• On stochastic optimization in sample allocation among strata
• Numerical solution of optimal allocation problems in stratified sampling under box constraints
• The stochastic knapsack problem
• A stochastic linear knapsack problem

Cites work

• scientific article; zbMATH DE number 4174193 (Why is no real title available?)
• scientific article; zbMATH DE number 3535464 (Why is no real title available?)
• scientific article; zbMATH DE number 822898 (Why is no real title available?)
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem

Cited in

(2)

• Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
• Applying fast simulation to find the number of good permutations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286279)