Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A dynamic programming algorithm for the knapsack problem with setup
Partially ordered knapsack and applications to scheduling
Subset sum problems with digraph constraints
An exact approach for the 0-1 knapsack problem with setups
Exact approaches for the knapsack problem with setups
The critical node detection problem in networks: a survey
Where are the hard knapsack problems?
Optimization algorithms for the disjunctively constrained knapsack problem
The knapsack problem with neighbour constraints
Hypergraph theory. An introduction
Approximation of knapsack problems with conflict and forcing graphs
Subset sum problems with special digraph constraints
The knapsack problem with special neighbor constraints
Knapsack problems with dependencies through non-additive measures and Choquet integral
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
The Dynamic and Stochastic Knapsack Problem
The Multidimensional Knapsack Problem: Structure and Algorithms
The 1-Neighbour Knapsack Problem
The Multiple-Choice Knapsack Problem
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
Improved dynamic programming and approximation results for the knapsack problem with setups
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
Reducibility among Combinatorial Problems
The Transitive Reduction of a Directed Graph

This page was built for publication: Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items