Exact approaches for the knapsack problem with setups
type: Item
instance of: scholarly article
title: Exact approaches for the knapsack problem with setups
zbMATH Open document ID: 1391.90516
author: Fabio Furini
author: Michele Monaci
author: Emiliano Traversi
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/18642
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6901539
zbMATH Keywords: knapsack problems
zbMATH Keywords: column generation
zbMATH Keywords: relaxations
zbMATH Keywords: branch-and-bound algorithms
zbMATH Keywords: computational experiments
Wikidata QID: Q57659004
describes a project that uses: Knapsack
MaRDI profile type: Publication
OpenAlex ID: W2755233613
cites work: Approximate and exact algorithms for the fixed-charge knapsack problem
cites work: Exact and heuristic solution approaches for the mixed integer setup knapsack problem
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Exact Algorithms For The Setup Knapsack Problem
cites work: A dynamic programming algorithm for the knapsack problem with setup
cites work: An exact approach for the 0-1 knapsack problem with setups
cites work: Selected Topics in Column Generation
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: Improving branch-and-cut performance by random sampling
cites work: Solving makespan minimization problems with Lagrangean decomposition
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: A note on the knapsack problem with special ordered sets
cites work: Q4821303
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: Q3993418
cites work: Knapsack problems with setups
cites work: Dynamic programming revisited: Improving knapsack algorithms
cites work: Improved dynamic programming and approximation results for the knapsack problem with setups
cites work: An exact algorithm for the Knapsack problem with setup
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
DOI: 10.1016/J.COR.2017.09.019
description: scientific article; zbMATH DE number 6901539