Tolerance analysis for 0-1 knapsack problems
type: Item
instance of: scholarly article
title: Tolerance analysis for 0-1 knapsack problems
zbMATH Open document ID: 1394.90493
author: David Pisinger
author: Alima Saidi
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6873549
zbMATH Keywords: robustness \& sensitivity analysis
zbMATH Keywords: knapsack problem
zbMATH Keywords: post-optimal analysis
zbMATH Keywords: dynamic programming
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.054
OpenAlex ID: W2547672618
Wikidata QID: Q58826312
cites work: Reoptimizing the 0-1 knapsack problem
cites work: Facets of the knapsack polytope
cites work: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
cites work: The inverse-parametric knapsack problem
cites work: Q3882189
cites work: On the exact separation of mixed integer knapsack cuts
cites work: Q4377042
cites work: Testing integer knapsacks for feasibility
cites work: Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
cites work: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
cites work: Q4821303
cites work: Integer Programming Post-Optimal Analysis with Cutting Planes
cites work: Stability, parametric, and postoptimality analysis of discrete optimization problems
cites work: Dynamic Programming and Strong Bounds 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: On the Robust Knapsack Problem
cites work: Exact solution of the robust knapsack problem
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: Core problems in knapsack algorithms
cites work: Einige bemerkungen zur bestimmung you stabilitätsbereiehen in der rein ganzzahligen iinearen optimierang
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
DBLP publication ID: journals/eor/PisingerS17
DOI: 10.1016/J.EJOR.2016.10.054
description: scientific article; zbMATH DE number 6873549