The following pages link to Knapsack (Q16891):
Displaying 50 items.
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Optimal partial hedging in a discrete-time market as a Knapsack problem (Q607677) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse (Q613357) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Optimal sequential inspection policies (Q646686) (← links)
- Selfish bin covering (Q650947) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- Stochastic set packing problem (Q713096) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Greedy algorithms for the minimization knapsack problem: average behavior (Q733910) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach (Q744689) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
- Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← links)
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem (Q840573) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Multiattribute electronic procurement using goal programming (Q858469) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Simplest optimal cutting patterns for equal rectangles (Q867922) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
