Knapsack with variable weights satisfying linear constraints
type: Item
instance of: scholarly article
title: Knapsack with variable weights satisfying linear constraints
zbMATH Open document ID: 1382.90091
author: Kameng Nip
author: Zizhuo Wang
author: Zhenbo Wang
published in: Journal of Global Optimization
publication date: 2017-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6816347
zbMATH Keywords: knapsack
zbMATH Keywords: linear programming
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10898-017-0540-y
OpenAlex ID: W2730861964
cites work: Mixed-integer bilinear programming problems
cites work: The Price of Robustness
cites work: Q5365145
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: On the Robust Knapsack Problem
cites work: Q4198056
cites work: Solving mixed integer bilinear problems using MILP formulations
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4821303
cites work: On the Complexity of Nonlinear Mixed-Integer Optimization
cites work: Scheduling under linear constraints
cites work: Algorithms for Scheduling Independent Tasks
cites work: A successive approximation algorithm for the multiple knapsack problem
cites work: The Design of Approximation Algorithms
cites work: Q4382667
DOI: 10.1007/S10898-017-0540-Y
description: scientific article; zbMATH DE number 6816347