Bi-dimensional knapsack problems with one soft constraint
type: Item
instance of: scholarly article
title: Bi-dimensional knapsack problems with one soft constraint
zbMATH Open document ID: 1391.90533
author: Britta Schulze
author: Luís Paquete
author: Kathrin Klamroth
author: José Rui Figueira
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6901278
zbMATH Keywords: bi-dimensional knapsack problem
zbMATH Keywords: bi-objective knapsack problem
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: soft constraints
zbMATH Keywords: dynamic programming
describes a project that uses: Cbc
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.012
OpenAlex ID: W2499304758
cites work: Bicriteria Transportation Problem
cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
cites work: Solving efficiently the 0-1 multi-objective knapsack problem
cites work: Random knapsack in expected polynomial time
cites work: Sensitivity analysis for knapsack problems: A negative result
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: Q3039055
cites work: Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: Q4198056
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Q3050129
cites work: Q3075630
cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
cites work: Q4821303
cites work: Constrained optimization using multiple objective programming
cites work: On the representation of the search region in multi-objective optimization
cites work: On an exact method for the constrained shortest path problem
cites work: CORAL: an exact algorithm for the multidimensional knapsack problem
cites work: On the Solution of Discrete Programming Problems
cites work: Q3993418
cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
cites work: Discrete Dynamic Programming and Capital Allocation
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: The multidimensional knapsack problem: structure and algorithms
cites work: Sensitivity analysis for knapsack problems: Another negative result
DOI: 10.1016/J.COR.2016.07.012
description: scientific article; zbMATH DE number 6901278