The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Probabilistic analysis of the multidimensional knapsack problem
Mathematics of Operations Research
Risk criteria in a stochastic knapsack problem
Operations Research
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
On finding and verifying locally optimal solutions
SIAM Journal on Computing
Optimal dispatch of interruptible and curtailable service options
Operations Research
Complexity classes of optimization functions
Information and Computation
Approximate solution of NP optimization problems
Theoretical Computer Science
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Dynamic and Stochastic Knapsack Problem
Operations Research
The Complexity of Optimization Problems
The Complexity of Optimization Problems
Testing Optimality for Quadratic 0-1 Problems
Testing Optimality for Quadratic 0-1 Problems
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
On the Approximability of Interactive Knapsack Problems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
| Hi-index | 0.00 |
The interactive knapsack problems are generalizations of the classical knapsack problem. Three different new NP-complete problems, interactive knapsack heuristic decision problem (IKHD), interactive knapsack decision problem (IKD) and multidimensional cloned knapsack decision problem (MDCS), are presented for the interactive knapsack models. IKD and MDCS are shown to be strongly NP-complete. By using interactive knapsacks we can model many planning and scheduling problems in an innovative way. Possible application areas include electricity management, single and multiprocessor scheduling, and packing and tiling problems. As a by-product we show that the longest weight-constrained path problem is NP-complete.