An expanding-core algorithm for the exact 0–1 knapsack problem-Reference-Cited by-同舟云学术

An expanding-core algorithm for the exact 0–1 knapsack problem

Published:1995-11 Issue:1 Volume:87 Page:175-187
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pisinger David

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. An algorithm for large zero-one Knapsack Problems;Balas;Operations Research,1980

2. Discrete variable extremum problems;Dantzig;Operations Research,1957

3. A reduction algorithm for Knapsack Problems;Dembo;Methods of Operations Research,1980

4. Exact methods for the Knapsack Problem and its generalizations;Dudzinski;European Journal of Operational Research,1987

5. An algorithm for the solution of the 0– Knapsack Problem;Fayard;Computing,1982

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

1. A self-adaptive arithmetic optimization algorithm with hybrid search modes for 0–1 knapsack problem;Neural Computing and Applications;2024-08-23

2. A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints;Mathematical Programming;2024-08-22

3. Features for the 0-1 knapsack problem based on inclusionwise maximal solutions;European Journal of Operational Research;2023-11

4. A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0–1 knapsack problems;Computers & Industrial Engineering;2023-04

5. Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems;Computers & Operations Research;2023-02