Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
type: Item
instance of: scholarly article
title: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
zbMATH Open document ID: 1133.90386
author: Mhand Hifi
author: Hedi Mhalla
author: Slim Sadfi
published in: Journal of Combinatorial Optimization
publication date: 2007-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 5189434
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: knapsacks
zbMATH Keywords: optimality
zbMATH Keywords: sensitivity analysis
describes a project that uses: MULKNAP
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10878-005-4105-5
OpenAlex ID: W2021247021
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Q3993418
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
cites work: An exact algorithm for large multiple knapsack problems
cites work: Q4247440
cites work: Core problems in knapsack algorithms
cites work: An LP-based approach to a two-stage cutting stock problem
DOI: 10.1007/S10878-005-4105-5
description: scientific article; zbMATH DE number 5189434