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

DOI10.1007/S10878-012-9579-3zbMATH Open1314.90072OpenAlexW2017253344MaRDI QIDQ489742FDOQ489742

Authors: Chenxia Zhao, Xianyue Li 

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

Recommendations

• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• Exact algorithm for solving knapsack problem with a single continuous variable
• A nonlinear knapsack problem
• A new approximation algorithm for the knapsack problem
• The continuous knapsack problem with capacities

zbMATH Keywords

approximation algorithmknapsacksingle continuous variable

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable

Cited In (5)

• Exact algorithm for solving knapsack problem with a single continuous variable
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
• Title not available (Why is that?)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489742)