An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
type: Item
instance of: scholarly article
title: An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
zbMATH Open document ID: 1229.90167
author: Geng Lin
author: M. Montaz Ali
author: Wenxing Zhu
published in: Journal of Global Optimization
publication date: 2011-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5969582
zbMATH Keywords: knapsack problem
zbMATH Keywords: mixed integer programming
zbMATH Keywords: branch and bound
Wikidata QID: Q57931977
describes a project that uses: Knapsack
describes a project that uses: MINTO
describes a project that uses: Quicksort
MaRDI profile type: Publication
full work available at URL: s10898-010-9642-5
OpenAlex ID: W2041673501
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Q4198056
cites work: Quicksort
cites work: Q4821303
cites work: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
cites work: The 0-1 knapsack problem with a single continuous variable
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: On the complexity of integer programming
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
DOI: 10.1007/S10898-010-9642-5
Recommended article: Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
Recommended article: Q4625581
Recommended article: The 0-1 knapsack problem with a single continuous variable
Recommended article: An exact algorithm for 0-1 polynomial Knapsack problems
Recommended article: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
Recommended article: An exact algorithm for the 0-1 collapsing knapsack problem
Recommended article: An exact approach for the 0-1 knapsack problem with setups
Recommended article: An exact algorithm for bilevel 0-1 knapsack problems
Recommended article: A linear-time algorithm for solving continuous maximin knapsack problems
Recommended article: A New Algorithm for the 0-1 Knapsack Problem
description: scientific article; zbMATH DE number 5969582