An exact decomposition algorithm for the generalized knapsack sharing problem

DOI10.1016/J.EJOR.2016.02.009MaRDI QIDQ322972zbMATH OpenOpenAlexFDO

Authors Isma Dahmani, Mhand Hifi, Lei Wu

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

exact decompositionknapsackreductionsharingupper bound

Mathematics Subject Classification ID

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

Recommendations

• The knapsack sharing problem: an exact algorithm
• An exact algorithm for large knapsack sharing problems
• An exact algorithm for the knapsack sharing problem
• An exact constructive algorithm for the knapsack sharing problem
• New upper bounds and exact methods for the knapsack sharing problem

Cites work

• A Minimal Algorithm for the 0-1 Knapsack Problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• An exact algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem with common items
• Computing Partitions with Applications to the Knapsack Problem
• Decomposition based hybrid metaheuristics
• Decomposition techniques in mathematical programming. Engineering and science applications.
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• New upper bounds and exact methods for the knapsack sharing problem
• Reducibility among combinatorial problems
• Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
• Special issue on knapsack problems and applications
• The Knapsack Sharing Problem
• The knapsack sharing problem: an exact algorithm

Cited in

(12)

• 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
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• New upper bounds and exact methods for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• An exact constructive algorithm for the knapsack sharing problem
• DP-based algorithm and FPTAS for the knapsack sharing and related problems
• An exact algorithm for large knapsack sharing problems
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
• The knapsack sharing problem: an exact algorithm
• An exact algorithm for the knapsack sharing problem with common items

Describes a project that uses

Uses Software

• Knapsack

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

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