The following pages link to (Q4821303):
Displaying 50 items.
- Knapsack (Q16891) (← links)
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Online knapsack revisited (Q260271) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Controlling selection areas of useful infeasible solutions for directed mating in evolutionary constrained multi-objective optimization (Q276522) (← links)
- Budget-constrained minimum cost flows (Q281825) (← links)
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- An adaptive stochastic knapsack problem (Q297367) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- Double system parts optimization: static and dynamic model (Q301482) (← links)
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Resource loading with time windows (Q319369) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution (Q322508) (← links)
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- Fast machine reassignment (Q338866) (← links)
- Loan origination decisions using a multinomial scorecard (Q338917) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- Algorithmic aspects for multiple-choice hardware/software partitioning (Q339684) (← links)
- Fractal patterns related to dividing coins (Q340462) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm (Q363591) (← links)
- Single machine scheduling problems with subcontracting options (Q385484) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (Q396653) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Probability aggregation in time-series: dynamic hierarchical modeling of sparse expert beliefs (Q400690) (← links)
- Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
