The following pages link to (Q3050129):
Displayed 22 items.
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Fast approximation algorithm for job sequencing with deadlines (Q1154384) (← links)
- On a general network location--production--allocation problem (Q1183612) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Bandwidth Constrained Multi-interface Networks (Q3075517) (← links)
- A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)