An efficient algorithm for the knapsack sharing problem

DOI10.1023/A:1019920507008MaRDI QIDQ1812082zbMATH OpenFDO

Authors Mhand Hifi, Slim Sadfi, Abdelkader Sbihi

Publication date 18 June 2003

Published in Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationheuristiclocal searchknapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Heuristic and reduction algorithms for the knapsack sharing problem
• An exact algorithm for large knapsack sharing problems
• An exact algorithm for the knapsack sharing problem with common items
• An exact constructive algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem

Cited in

(9)

• An exact algorithm for large knapsack sharing problems
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• New upper bounds and exact methods for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem with common items
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
• Bounded knapsack sharing
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds

This page was built for publication: An efficient algorithm for the knapsack sharing problem

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