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.
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- Correspondence principle as equivalence of categories (Q1702195) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Faster algorithms for computing power indices in weighted voting games (Q1779724) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem (Q2026995) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Graph characterization by counting sink star subgraphs (Q2360843) (← links)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- Resource allocation for epidemic control across multiple sub-populations (Q2417535) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- On the connection between Hamming codes, Heapsort and other methods (Q2444852) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Faà di Bruno's formula, lattices, and partitions (Q2486068) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study (Q2883592) (← links)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis (Q3905066) (← links)
- Cutting optimization with variable-sized stock and inventory status data (Q4468878) (← links)
- Inductive Complexity of P versus NP Problem (Q4648186) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- Some New Orders of Hadamard and Skew‐Hadamard Matrices (Q4979579) (← links)
- Specific patterns in the number of lines of<i>The Sumerian Temple Hymns</i> (Q5029426) (← links)
- (Q5075820) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
