Knapsack problems with setups
type: Item
instance of: scholarly article
title: Knapsack problems with setups
zbMATH Open document ID: 1176.90175
author: J. Blot
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
full work available at URL: fcknpWorkingPaperRevision2.pdf
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 5642753
zbMATH Keywords: knapsack problem
zbMATH Keywords: fixed cost
zbMATH Keywords: setup
zbMATH Keywords: variable upper bound
zbMATH Keywords: branch-and-bound
describes a project that uses: Knapsack
describes a project that uses: XPRESS
MaRDI profile type: Publication
OpenAlex ID: W2060438679
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Exact Algorithms For The Setup Knapsack Problem
cites work: Discrete-Variable Extremum Problems
cites work: Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.
cites work: A note on the knapsack problem with special ordered sets
cites work: Q4821303
cites work: Q3993418
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4247440
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
cites work: Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
cites work: Implementing Mixed Integer Column Generation
DOI: 10.1016/J.EJOR.2008.05.001
description: scientific article; zbMATH DE number 5642753