The knapsack problem with a minimum filling constraint
From MaRDI portal
Publication:3120586
DOI10.1002/nav.21520zbMath1407.90280OpenAlexW1979711080MaRDI QIDQ3120586
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21520
Related Items (5)
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ 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
This page was built for publication: The knapsack problem with a minimum filling constraint
