A Minimal Algorithm for the Bounded Knapsack Problem

DOI10.1287/IJOC.12.1.75.11898MaRDI QIDQ4427321zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David Pisinger

Publication date 6 November 2003

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.12.1.75.11898

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A minimal algorithm for the bounded knapsack problem
• Algorithms for the bounded set-up knapsack problem
• A hybrid algorithm for the unbounded knapsack problem
• Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
• Dynamic programming revisited: Improving knapsack algorithms

Cited in

(28)

• A hybrid algorithm for the unbounded knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved state space relaxation for constrained two-dimensional guillotine cutting problems
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• Introduction of an underground waste container system-model and solution approaches
• A well-solvable special case of the bounded knapsack problem
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Algorithms for the bounded set-up knapsack problem
• The transit time constrained fixed charge multi-commodity network design problem
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• The knapsack problem with a minimum filling constraint
• Robust efficiency measures for linear knapsack problem variants
• Determining the K-best solutions of knapsack problems
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Ring theory-based improved monkey algorithm for bounded knapsack problem
• A minimal algorithm for the bounded knapsack problem
• Core accelerated firefly algorithm for solving bounded knapsack problem
• A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
• A novel reformulation for the single-sink fixed-charge transportation problem
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
• Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• The constrained compartmentalised knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: A Minimal Algorithm for the Bounded Knapsack Problem

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