An algorithm for the solution of the 0–1 knapsack problem-Reference-Cited by-同舟云学术

An algorithm for the solution of the 0–1 knapsack problem

Published:1982-09 Issue:3 Volume:28 Page:269-287
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Fayard D.,Plateau G.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02241754.pdf

Reference12 articles.

1. Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Operations Research28, 1130–1154 (1980).

2. Fayard, D., Plateau, G.: Resolution of the 0–1 knapsack problem: comparison of methods. Mathematical Programming8, 272–307 (1975).

3. Fayard, D., Plateau, G.: Techniques de résolution du problème du knapsack en variables bivalentes: partie III. Publication 91, Laboratoire de Calcul, Université des Sciences et Techniques de Lille I, France (1977).

4. Fayard, D., Plateau, G.: Reduction algorithms for single and multiple constraints 0–1 linear programming problems. Proceedings of the Congress Methods of Mathematical Programming, Zakopane, Poland, 1977.

5. Fayard, D., Plateau, G.: On “an efficient algorithm for the 0–1 knapsack problem, by Robert M. Nauss”. Management Science24, 918–919 (1978).

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

1. A general purpose exact solution method for mixed integer concave minimization problems;European Journal of Operational Research;2023-09

2. Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem;European Journal of Operational Research;2023-02

3. Optimised reactive resource aware routing for wireless infrastructure-less networks;International Journal of Computer Applications in Technology;2023

4. Dantzig–Wolfe reformulations for binary quadratic problems;Mathematical Programming Computation;2022-01-03

5. On Bilevel Optimization with Inexact Follower;Decision Analysis;2020-03