New upper bounds and exact methods for the knapsack sharing problem

DOI10.1016/J.AMC.2013.11.040zbMATH Open1364.90292OpenAlexW2093939346MaRDI QIDQ2396494FDOQ2396494

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

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

zbMATH Keywords

combinatorial optimizationdecompositionoptimalityupper bounddiscrete optimizationknapsacksharing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (8)

• Bounded knapsack sharing
• An exact constructive algorithm for the knapsack sharing problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• 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
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
• An exact algorithm for the knapsack sharing problem

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)