The knapsack problem with a minimum filling constraint
From MaRDI portal
Recommendations
- The constrained compartmentalised knapsack problem
- The knapsack problem with neighbour constraints
- A minimal algorithm for the bounded knapsack problem
- A Minimal Algorithm for the Bounded Knapsack Problem
- scientific article; zbMATH DE number 4005976
- The knapsack problem with special neighbor constraints
- A minimal algorithm for the multiple-choice knapsack problem
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
Cited in
(13)- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Optimal pricing policy design for selling cost-reducing innovation in Cournot games
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- The knapsack problem with forfeits
- The 1-Neighbour Knapsack Problem
- scientific article; zbMATH DE number 431495 (Why is no real title available?)
- A Knapsack Secretary Problem with Applications
- Minmax linear knapsack problem with grouped variables and gub
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs
- A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
- Algorithms for the one-dimensional two-stage cutting stock problem
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- The constrained compartmentalised knapsack problem
This page was built for publication: The knapsack problem with a minimum filling constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120586)
