The following pages link to (Q3792481):
Displaying 14 items.
- A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Probabilistic analysis of the generalised assignment problem (Q1196166) (← links)
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem (Q1280190) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628) (← links)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems (Q4225866) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5918435) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)
