New upper bounds and exact methods for the knapsack sharing problem

DOI10.1016/J.AMC.2013.11.040MaRDI QIDQ2396494zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, Lei Wu

Publication date 8 June 2017

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2013.11.040

zbMATH Keywords

combinatorial optimizationdecompositionoptimalityupper bounddiscrete optimizationknapsacksharing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An exact algorithm for large knapsack sharing problems
• An exact constructive algorithm for the knapsack sharing problem
• An exact decomposition algorithm for the generalized knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• The knapsack sharing problem: an exact algorithm

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• A linear-time algorithm for solving continuous maximin knapsack problems
• A min-max resource allocation problem with substitutions
• An efficient algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• Heuristic and reduction algorithms for the knapsack sharing problem
• Minimax resource allocation problems: Optimization and parametric analysis
• Solving knapsack sharing problems with general tradeoff functions
• Special issue on knapsack problems and applications
• The Knapsack Sharing Problem
• The knapsack sharing problem: an exact algorithm

Cited in

(8)

• An exact algorithm for large knapsack sharing problems
• An exact algorithm for the knapsack sharing problem
• The knapsack sharing problem: an exact algorithm
• An exact decomposition algorithm for the generalized knapsack sharing problem
• An exact constructive algorithm for the knapsack sharing problem
• Bounded knapsack sharing
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds

Describes a project that uses

Uses Software

• CPLEX
• Knapsack

This page was built for publication: New upper bounds and exact methods for the knapsack sharing problem

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