An exact constructive algorithm for the knapsack sharing problem

DOI10.1080/10556788.2016.1240795MaRDI QIDQ4594846zbMATH OpenOpenAlexFDO

Authors Hedi Mhalla

Publication date 24 November 2017

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2016.1240795

zbMATH Keywords

optimizationheuristicscombinatorial optimizationbranch and boundknapsack sharinginterval reduction

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• The knapsack sharing problem: an exact algorithm
• Heuristic and reduction algorithms for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• An exact decomposition algorithm for the generalized knapsack sharing problem
• New upper bounds and exact methods for the knapsack sharing problem

Cited in

(9)

• Bounded knapsack sharing
• An efficient algorithm for the knapsack sharing problem
• An exact algorithm for large knapsack sharing problems
• An exact decomposition algorithm for the generalized knapsack sharing problem
• The knapsack sharing problem: an exact algorithm
• An exact algorithm for the knapsack sharing problem
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
• Cooperative and axiomatic approaches to the knapsack allocation problem
• New upper bounds and exact methods for the knapsack sharing problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: An exact constructive 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 Q4594846)