Expectation analysis for bounding solutions of the 0-1 knapsack problem

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial identities, bijective combinatorics (05A19) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
Minimum and worst-case performance ratios of rollout algorithms
Algorithms for the one-dimensional two-stage cutting stock problem
Greedy algorithms for the minimization knapsack problem: average behavior
Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
An expanding-core algorithm for the exact \(0-1\) knapsack problem
Dynamic programming on the word RAM
A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
Where are the hard knapsack problems?
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
A new class of hard problem instances for the 0-1 knapsack problem
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem
Average-case performance of rollout algorithms for knapsack problems
Discrete Probability Models and Methods
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
A New Algorithm for the 0-1 Knapsack Problem
Hard Knapsack Problems
An Algorithm for Large Zero-One Knapsack Problems
Computing Partitions with Applications to the Knapsack Problem
Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
Linear Time Algorithms for Knapsack Problems with Bounded Weights
Reducibility among Combinatorial Problems

This page was built for publication: Expectation analysis for bounding solutions of the 0-1 knapsack problem

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