The following pages link to Knapsack (Q16891):
Displaying 50 items.
- A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Combinatorial optimization problems in wireless switch design (Q926564) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202) (← links)
- An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Design and performance evaluation of contentplace, a social-aware data dissemination system for opportunistic networks (Q975068) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- A multi-level genetic algorithm for a multi-stage space allocation problem (Q984123) (← links)
- Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- The 0-1 knapsack problem with fuzzy data (Q1001155) (← links)
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections (Q1007645) (← links)
- Algorithmic aspects for power-efficient hardware/software partitioning (Q1010046) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- Knapsack problems with setups (Q1041933) (← links)
