Pages that link to "Item:Q3832316"

The following pages link to Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316):

Displaying 21 items.

• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Smoothed analysis of integer programming (Q877191) (← links)
• A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
• The generalized assignment problem with flexible jobs (Q1003754) (← links)
• Probabilistic analysis of the generalised assignment problem (Q1196166) (← links)
• Average saving effects in enumerative methods for solving knapsack problems (Q1319356) (← links)
• Solving the 0-1 proportional knapsack problem by sampling (Q1321464) (← links)
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
• Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra (Q1396210) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Stochastic on-line knapsack problems (Q1804369) (← links)
• Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628) (← links)
• Note on the knapsack Markov chain. (Q1888773) (← links)
• An experimental study of random knapsack problems (Q2369879) (← links)
• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
• (Q3792480) (← links)
• The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← 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)