Computing Partitions with Applications to the Knapsack Problem

Cited in

(only showing first 100 items - show all)

Some new orders of Hadamard and skew-Hadamard matrices
Qos-aware service evaluation and selection
Correspondence principle as equivalence of categories
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
An algebraic expression of the number partitioning problem
Two linear approximation algorithms for the subset-sum problem
Weighted shortest common supersequence problem revisited
Approximating subset sum ratio via partition computations
Adjacency of the 0-1 knapsack problem
On the product knapsack problem
An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
The Meet-in-the-Middle Principle for Cutting and Packing Problems
An exact approach for the 0-1 knapsack problem with setups
Moderate exponential-time algorithms for scheduling problems
Generalization of the subset sum problem and cubic forms
Specific patterns in the number of lines of \textit{The Sumerian Temple Hymns}
An improved balanced algorithm for the subset-sum problem
On an extension of the Sort \& Search method with application to scheduling theory
Parallel time and space upper-bounds for the subset-sum problem
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
Cutting optimization with variable-sized stock and inventory status data
Some thoughts on combinatorial optimisation
Static main storage packing problems
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
On exponential time lower bound of Knapsack under backtracking
Heuristic and exact algorithms for the precedence-constrained knapsack problem
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
Graph characterization by counting sink star subgraphs
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
Bounding the running time of algorithms for scheduling and packing problems
An improved direct descent algorithm for binary knapsack problems
Open problems around exact algorithms
Random knapsack in expected polynomial time
On the connection between Hamming codes, Heapsort and other methods
Pattern matching and consensus problems on weighted sequences and profiles
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
Approximating subset sum ratio via subset sum computations
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Faster Pseudopolynomial Time Algorithms for Subset Sum
New exact algorithms for the 2-constraint satisfaction problem
Complement, complexity, and symmetric representation
Integer linear programming model for multidimensional two-way number partitioning problem
Solution of the zero-one multiple knapsack problem
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
Representational information: a new general notion and measure of information
Inversion of convection-diffusion equation with discrete sources
An efficient pruning algorithm for value independent knapsack problem using a DAG structure
Approximation schemes for subset-sums ratio problems
Exact approaches for the knapsack problem with setups
Assigning channels via the meet-in-the-middle approach
Branching in branch-and-price: A generic scheme
Observations on optimal parallelizations of two-list algorithm
Sort and Search: exact algorithms for generalized domination
Algorithms for the one-dimensional two-stage cutting stock problem
On structural decompositions of finite frames
Improved classical and quantum algorithms for subset-sum
scientific article; zbMATH DE number 7250146 (Why is no real title available?)
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Inductive complexity of P versus NP problem (extended abstract)
On bilevel optimization with inexact follower
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
Improved Merlin-Arthur protocols for central problems in fine-grained complexity
An exact algorithm for the knapsack sharing problem with common items
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Subset Sum Quantumly in 1.17 n .
Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
A ``maximum node clustering problem
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Hardness of approximation for knapsack problems
An algorithm and efficient data structures for the binary knapsack problem
A low-space algorithm for the subset-sum problem on GPU
Approximation schemes for a class of subset selection problems
Solving robust bin-packing problems with a branch-and-price approach
A successive approximation algorithm for the multiple knapsack problem
An exact decomposition algorithm for the generalized knapsack sharing problem
A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Resource allocation for epidemic control across multiple sub-populations
A note on the complexity of a partition algorithm
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
New trends in exact algorithms for the $0-1$ knapsack problem
Zero-one integer programs with few contraints - lower bounding theory
Computational integrity with a public random string from quasi-linear PCPs
Solving sparse instances of Max SAT via width reduction and greedy restriction
On the exact separation of mixed integer knapsack cuts
An exact algorithm for the budget-constrained multiple knapsack problem
A dynamic programming algorithm for the knapsack problem with setup
New time-memory trade-offs for subset sum -- improving ISD in theory and practice
scientific article; zbMATH DE number 7525510 (Why is no real title available?)
Expectation analysis for bounding solutions of the 0-1 knapsack problem
A new algorithm for optimal 2-constraint satisfaction and its implications
The complexity of searching in $X+Y$ and other multisets
Change-making problems revisited: a parameterized point of view

This page was built for publication: Computing Partitions with Applications to the Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096145)