Litcius/Paper detail

Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem

Christophe Wilbaut, Raca Todosijević, Saïd Hanafi, Arnaud Fréville

2022European Journal of Operational Research14 citationsDOI

Topics & Concepts

Knapsack problemMathematical optimizationSolverContinuous knapsack problemHeuristicReduction (mathematics)PreprocessorComputer scienceMathematicsMetaheuristicCutting stock problemSet (abstract data type)AlgorithmOptimization problemArtificial intelligenceProgramming languageGeometryOptimization and Packing ProblemsAdvanced Manufacturing and Logistics OptimizationVehicle Routing Optimization Methods
Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem | Litcius