An exact constructive algorithm for the knapsack sharing problem

DOI10.1080/10556788.2016.1240795zbMath1382.90090OpenAlexW2547604708MaRDI QIDQ4594846

Hedi Mhalla

Publication date: 24 November 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

optimizationheuristicscombinatorial optimizationbranch and boundinterval reductionknapsack sharing

Mathematics Subject Classification ID

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

Related Items (1)

An exact algorithm for large knapsack sharing problems

Uses Software

• CPLEX

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