Computing Partitions with Applications to the Knapsack Problem

Cited In (only showing first 100 items - show all)

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
On an extension of the Sort \& Search method with application to scheduling theory
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
Bounding the running time of algorithms for scheduling and packing problems
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
Random knapsack in expected polynomial time
An improved direct descent algorithm for binary knapsack problems
Open problems around exact algorithms
Approximating subset sum ratio via subset sum computations
Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
New exact algorithms for the 2-constraint satisfaction problem
Integer linear programming model for multidimensional two-way number partitioning problem
Solution of the zero-one multiple knapsack problem
Inversion of convection-diffusion equation with discrete sources
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
Approximation schemes for subset-sums ratio problems
Assigning channels via the meet-in-the-middle approach
Observations on optimal parallelizations of two-list algorithm
Branching in branch-and-price: A generic scheme
Sort and Search: exact algorithms for generalized domination
Algorithms for the one-dimensional two-stage cutting stock problem
On structural decompositions of finite frames
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Inductive complexity of P versus NP problem (extended abstract)
The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
An exact algorithm for the knapsack sharing problem with common items
Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
Approximation schemes for a class of subset selection problems
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
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
Solving sparse instances of Max SAT via width reduction and greedy restriction
On the exact separation of mixed integer knapsack cuts
A dynamic programming algorithm for the knapsack problem with setup
A new algorithm for optimal 2-constraint satisfaction and its implications
The complexity of searching in $X+Y$ and other multisets
Solving binary cutting stock problems by column generation and branch- and-bound
Faà di Bruno's formula, lattices, and partitions
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
An exact algorithm for large multiple knapsack problems
An experimental study of random knapsack problems
The zero-one knapsack problem with equality constraint
A complete anytime algorithm for number partitioning
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
A new enumeration scheme for the knapsack problem
An exact algorithm for the knapsack sharing problem
Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
Dynamic programming algorithms for the zero-one knapsack problem
Faster algorithms for computing power indices in weighted voting games
Some new orders of Hadamard and skew-Hadamard matrices
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
Qos-aware service evaluation and selection
A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Adjacency of the 0-1 knapsack problem
On the product knapsack problem
A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
An exact approach for the 0-1 knapsack problem with setups
Cutting optimization with variable-sized stock and inventory status data
Some thoughts on combinatorial optimisation
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Static main storage packing problems
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
Graph characterization by counting sink star subgraphs
On the connection between Hamming codes, Heapsort and other methods
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
Pattern matching and consensus problems on weighted sequences and profiles
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
Faster Pseudopolynomial Time Algorithms for Subset Sum
Complement, complexity, and symmetric representation
An efficient pruning algorithm for value independent knapsack problem using a DAG structure
Exact approaches for the knapsack problem with setups
Improved classical and quantum algorithms for subset-sum
Title not available (Why is that?)
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
On bilevel optimization with inexact follower
Improved Merlin-Arthur protocols for central problems in fine-grained complexity
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
Subset Sum Quantumly in 1.17 n .
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
A ``maximum node clustering problem
Hardness of approximation for knapsack problems
A low-space algorithm for the subset-sum problem on GPU
An algorithm and efficient data structures for the binary knapsack problem
Solving robust bin-packing problems with a branch-and-price approach
Resource allocation for epidemic control across multiple sub-populations
Computational integrity with a public random string from quasi-linear PCPs
An exact algorithm for the budget-constrained multiple knapsack problem

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)