Exact Algorithms For The Setup Knapsack Problem

DOI10.1080/03155986.1994.11732244MaRDI QIDQ4313817zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Boolean functionslogical constraintsmachine schedulingsetup knapsack problemtwo-phase enumerative scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• A dynamic programming algorithm for the knapsack problem with setup
• Exact approaches for the knapsack problem with setups
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• An exact algorithm for the Knapsack problem with setup
• Knapsack problems with setups

Cited in

(23)

• Knapsack problems with setups
• An exact approach for the 0-1 knapsack problem with setups
• Exact approaches for the knapsack problem with setups
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• A cross entropy algorithm for the Knapsack problem with setups
• Algorithms for the bounded set-up knapsack problem
• Approximate and exact algorithms for the fixed-charge knapsack problem
• A faster exact method for large-scale knapsack problems with setup costs and times
• Integer knapsack problems with set-up weights
• The replenishment problem with multiple articles and an order threshold
• A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
• A dynamic programming algorithm for the knapsack problem with setup
• scientific article; zbMATH DE number 3989108 (Why is no real title available?)
• scientific article; zbMATH DE number 698819 (Why is no real title available?)
• Improved dynamic programming and approximation results for the knapsack problem with setups
• An homage to Joseph-Louis Lagrange and Pierre Huard
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Lifting cover inequalities for the precedence-constrained knapsack problem
• The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
• The quadratic knapsack problem with setup
• An exact algorithm for the Knapsack problem with setup
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem

This page was built for publication: Exact Algorithms For The Setup Knapsack Problem

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