A Shrinking Boundary Algorithm for Discrete System Models

DOI10.1109/TSSC.1970.300288MaRDI QIDQ5595641zbMATH OpenOpenAlexFDO

Authors Robert Saunders, Roland Schinzinger

Publication date 1970

Published in IEEE Transactions on Systems Science and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tssc.1970.300288

zbMATH Keywords

operations research

Cited in

(6)

• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• Resolution of the 0–1 knapsack problem: Comparison of methods
• An algorithm for the 0/1 Knapsack problem
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem

This page was built for publication: A Shrinking Boundary Algorithm for Discrete System Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595641)