A well-solvable special case of the bounded knapsack problem-Reference-Cited by-同舟云学术

A well-solvable special case of the bounded knapsack problem

Published:2011-03 Issue:2 Volume:39 Page:118-120
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Deineko Vladimir G.,Woeginger Gerhard J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference7 articles.

1. Reducibility among combinatorial problems;Karp,1972

2. G.S. Lueker, Two NP-complete problems in non-negative integer programming. Report No. 178, Computer Science Laboratory, Princeton University, 1975.

3. The cutting stock problem and integer rounding;Marcotte;Mathematical Programming,1985

4. Knapsack Problems: Algorithms and Computer Implementations;Martello,1990

5. Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation;Pochet;Discrete Applied Mathematics,1995

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions;Algorithms;2024-05-18

2. Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks;Computers & Operations Research;2024-02

3. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems;Computers & Operations Research;2022-07

4. Effects of Differentiated 5G Services on Computational and Radio Resource Allocation Performance;IEEE Transactions on Network and Service Management;2021-06

5. Distributed Detection with Unreliable Data Sources;Secure Networked Inference with Unreliable Data Sources;2018