Computing Partitions with Applications to the Knapsack Problem

Cited in

(only showing first 100 items - show all)

A successive approximation algorithm for the multiple knapsack problem
The zero-one knapsack problem with equality constraint
Zero-one integer programs with few contraints - lower bounding theory
A new enumeration scheme for the knapsack problem
An improved direct descent algorithm for binary knapsack problems
An exact algorithm for large multiple knapsack problems
Dynamic programming algorithms for the zero-one knapsack problem
Solution of the zero-one multiple knapsack problem
Adjacency of the 0-1 knapsack problem
Static main storage packing problems
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
An algorithm and efficient data structures for the binary knapsack problem
A complete anytime algorithm for number partitioning
Solving binary cutting stock problems by column generation and branch- and-bound
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
Some thoughts on combinatorial optimisation
New trends in exact algorithms for the $0-1$ knapsack problem
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Heuristic and exact algorithms for the precedence-constrained knapsack problem
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
An exact approach for the 0-1 knapsack problem with setups
A low-space algorithm for the subset-sum problem on GPU
Exact approaches for the knapsack problem with setups
On the product knapsack problem
Change-making problems revisited: a parameterized point of view
Correspondence principle as equivalence of categories
An improved balanced algorithm for the subset-sum problem
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
Faster algorithms for computing power indices in weighted voting games
A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
An efficient pruning algorithm for value independent knapsack problem using a DAG structure
Two linear approximation algorithms for the subset-sum problem
Pattern matching and consensus problems on weighted sequences and profiles
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
Solving robust bin-packing problems with a branch-and-price approach
Actively secure setup for SPDZ
Moderate exponential-time algorithms for scheduling problems
Inversion of convection-diffusion equation with discrete sources
Approximation schemes for subset-sums ratio problems
Approximating subset sum ratio via subset sum computations
An algebraic expression of the number partitioning problem
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Hardness of approximation for knapsack problems
Graph characterization by counting sink star subgraphs
An experimental study of random knapsack problems
Approximation schemes for a class of subset selection problems
Resource allocation for epidemic control across multiple sub-populations
New exact algorithms for the 2-constraint satisfaction problem
On the connection between Hamming codes, Heapsort and other methods
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
Open problems around exact algorithms
A ``maximum node clustering problem
An exact algorithm for the knapsack sharing problem
Faà di Bruno's formula, lattices, and partitions
A new algorithm for optimal 2-constraint satisfaction and its implications
Improved classical and quantum algorithms for subset-sum
Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
An exact algorithm for the budget-constrained multiple knapsack problem
Assigning channels via the meet-in-the-middle approach
Complement, complexity, and symmetric representation
On structural decompositions of finite frames
An exact decomposition algorithm for the generalized knapsack sharing problem
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
A dynamic programming algorithm for the knapsack problem with setup
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
On an extension of the Sort \& Search method with application to scheduling theory
Cutting optimization with variable-sized stock and inventory status data
Inductive complexity of P versus NP problem (extended abstract)
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
Faster Pseudopolynomial Time Algorithms for Subset Sum
Some new orders of Hadamard and skew-Hadamard matrices
Specific patterns in the number of lines of \textit{The Sumerian Temple Hymns}
Equal-subset-sum faster than the meet-in-the-middle
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
On bilevel optimization with inexact follower
scientific article; zbMATH DE number 7250146 (Why is no real title available?)
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Computational integrity with a public random string from quasi-linear PCPs
Inductive complexity of the P versus NP problem
On the exact separation of mixed integer knapsack cuts
Subset Sum Quantumly in 1.17 n .
Bounding the running time of algorithms for scheduling and packing problems
Random knapsack in expected polynomial time
Generalization of the subset sum problem and cubic forms
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
New time-memory trade-offs for subset sum -- improving ISD in theory and practice
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Improved Merlin-Arthur protocols for central problems in fine-grained complexity
Integer linear programming model for multidimensional two-way number partitioning problem
A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Branching in branch-and-price: A generic scheme
Weighted shortest common supersequence problem revisited

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)