scientific article
From MaRDI portal
Publication:3792481
zbMath0647.90062MaRDI QIDQ3792481
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
An experimental study of random knapsack problems ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ A probabilistic analysis of the multiknapsack value function ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ Probabilistic analysis of the generalised assignment problem ⋮ Random knapsack in expected polynomial time ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ A class of generalized greedy algorithms for the multi-knapsack problem ⋮ Stochastic on-line knapsack problems ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. ⋮ The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem
This page was built for publication:
