Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable

DOI10.1007/s10878-012-9579-3zbMath1314.90072OpenAlexW2017253344MaRDI QIDQ489742

Xianyue Li, Chenxia Zhao

Publication date: 21 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9579-3

zbMATH Keywords

approximation algorithmknapsacksingle continuous variable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• The 0-1 knapsack problem with a single continuous variable
• On the facets of the mixed-integer knapsack polyhedron
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem

This page was built for publication: Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable