A Minimal Algorithm for the 0-1 Knapsack Problem
From MaRDI portal
Publication:4393123
DOI10.1287/opre.45.5.758zbMath0902.90126WikidataQ58826514 ScholiaQ58826514MaRDI QIDQ4393123
Publication date: 10 August 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8dcdff6a283a7961ccc8be089533d79c9f66e80a
90C06: Large-scale problems in mathematical programming
90C10: Integer programming
90C39: Dynamic programming
90C09: Boolean programming
Related Items
An exact algorithm for the subset sum problem, Model and algorithms for multi-period sea cargo mix problem, The quadratic knapsack problem -- a survey, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Heuristic approaches for the two- and three-dimensional knapsack packing problem, A branch-and-price algorithm for the two-dimensional level strip packing problem, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, An exact algorithm for large multiple knapsack problems, A fast algorithm for strongly correlated knapsack problems, Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth, Discrete facility location and routing of obnoxious activities., Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, New trends in exact algorithms for the \(0-1\) knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Where are the hard knapsack problems?, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Heuristics for the container loading problem, Solving the swath segment selection problem through Lagrangean relaxation, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Algorithms for solving the single-sink fixed-charge transportation problem, An optimization algorithm for a penalized knapsack problem, A best first search exact algorithm for the multiple-choice multidimensional knapsack problem, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, An efficient algorithm for the collapsing knapsack problem, Tree knapsack approaches for local access network design, A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem, Approximate and exact algorithms for the fixed-charge knapsack problem, An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
Uses Software
