Binary knapsack problems with random budgets

DOI10.1057/palgrave.jors.2601596zbMath1095.90587OpenAlexW2056543368MaRDI QIDQ4661177

Shubhabrata Das, Diptesh Ghosh

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601596

zbMATH Keywords

branch and boundrandom budgetstatic stochastic knapsack problem

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items

An improved typology of cutting and packing problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem ⋮ Optimal road maintenance investment in traffic networks with random demands ⋮ Exact solution of a class of nonlinear knapsack problems

This page was built for publication: Binary knapsack problems with random budgets