Pages that link to "Item:Q1238705"

The following pages link to Approximate algorithms for some generalized knapsack problems (Q1238705):

Displaying 15 items.

• Vector bin packing with multiple-choice (Q427903) (← links)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
• A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
• Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• APPLICATION PLACEMENT ON A CLUSTER OF SERVERS (Q3065615) (← links)