scientific article; zbMATH DE number 698819

DOI10.1002/1520-6750(199410)41:6%3C833::AID-NAV3220410611%3E3.0.CO;2-QMaRDI QIDQ4314864zbMATH OpenFDO

Authors Olivier Goldschmidt, David Nehme, Gang Yu

Publication date 1 December 1994

Full work available at URL https://doi.org/10.1002/1520-6750(199410)41:6%3C833::AID-NAV3220410611%3E3.0.CO;2-Q

zbMATH Keywords

generalization of the 0-1 knapsack problemmachine loading in flexible manufacturing systemsNP-hardset-union knapsack

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Exact Algorithms For The Setup Knapsack Problem
• scientific article; zbMATH DE number 1302173
• Algorithms for some hard knapsack problems
• Exact methods for the knapsack problem and its generalizations
• scientific article; zbMATH DE number 4005978

Cited in

(11)

• Combinatorial optimization models for production scheduling in automated manufacturing systems
• The knapsack problem with neighbour constraints
• Algorithms and complexity for a class of combinatorial optimization problems with labelling
• The incremental connected facility location problem
• A note on the set union knapsack problem
• The complexity of detecting fixed-density clusters
• Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
• The knapsack problem with forfeit sets
• Adaptive operator selection with reinforcement learning
• Coordinating monetary contributions in participatory budgeting
• The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications

This page was built for publication:

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