An exact decomposition algorithm for the generalized knapsack sharing problem

DOI10.1016/j.ejor.2016.02.009zbMath1346.90699OpenAlexW2256182704MaRDI QIDQ322972

Mhand Hifi, Lei Wu, Isma Dahmani

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.009

zbMATH Keywords

upper boundreductionknapsackexact decompositionsharing

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (5)

An exact algorithm for large knapsack sharing problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Operations research applications of dichotomous search ⋮ Price of fairness for allocating a bounded resource ⋮ Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition based hybrid metaheuristics
• Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
• The knapsack sharing problem: an exact algorithm
• An exact algorithm for the knapsack sharing problem with common items
• Special issue on knapsack problems and applications
• New upper bounds and exact methods for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Computing Partitions with Applications to the Knapsack Problem
• The Knapsack Sharing Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Reducibility among Combinatorial Problems

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