Exact Algorithms For The Setup Knapsack Problem
From MaRDI portal
Publication:4313817
DOI10.1080/03155986.1994.11732244zbMath0811.90072OpenAlexW2397423536MaRDI QIDQ4313817
Emmanuel D. Chajakis, Monique Guignard
Publication date: 29 November 1994
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1994.11732244
machine schedulingBoolean functionslogical constraintssetup knapsack problemtwo-phase enumerative scheme
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (15)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Integer knapsack problems with set-up weights ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ Exact approaches for the knapsack problem with setups ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ The replenishment problem with multiple articles and an order threshold ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Exact and heuristic solution approaches for the mixed integer setup knapsack problem ⋮ Lifting cover inequalities for the precedence-constrained knapsack problem ⋮ Algorithms for the bounded set-up knapsack problem ⋮ The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ Knapsack problems with setups ⋮ Approximate and exact algorithms for the fixed-charge knapsack problem
This page was built for publication: Exact Algorithms For The Setup Knapsack Problem
