Knapsack with variable weights satisfying linear constraints

DOI10.1007/s10898-017-0540-yzbMath1382.90091OpenAlexW2730861964MaRDI QIDQ1683329

Zizhuo Wang, Kameng Nip, Zhen-bo Wang

Publication date: 7 December 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0540-y

zbMATH Keywords

computational complexitylinear programmingapproximation algorithmknapsack

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints ⋮ Some graph optimization problems with weights satisfying linear constraints ⋮ Related machine scheduling with machine speeds satisfying linear constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling under linear constraints
• Mixed-integer bilinear programming problems
• A successive approximation algorithm for the multiple knapsack problem
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• On the Complexity of Nonlinear Mixed-Integer Optimization
• The Design of Approximation Algorithms
• The Price of Robustness
• Algorithms for Scheduling Independent Tasks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• On the Robust Knapsack Problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Knapsack with variable weights satisfying linear constraints