Pages that link to "Item:Q4096145"
From MaRDI portal
The following pages link to Computing Partitions with Applications to the Knapsack Problem (Q4096145):
Displaying 50 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Integer linear programming model for multidimensional two-way number partitioning problem (Q623171) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Representational information: a new general notion and measure of information (Q713074) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- A note on the complexity of a partition algorithm (Q788493) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
- Qos-aware service evaluation and selection (Q932236) (← 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)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Observations on optimal parallelizations of two-list algorithm (Q991072) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- The zero-one knapsack problem with equality constraint (Q1058453) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Static main storage packing problems (Q1241277) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
- An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
- A complete anytime algorithm for number partitioning (Q1277696) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- On the product knapsack problem (Q1653266) (← links)
