scientific article; zbMATH DE number 698819
From MaRDI portal
Publication:4314864
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q" /><833::AID-NAV3220410611>3.0.CO;2-Q 10.1002/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-QzbMath0831.90088MaRDI QIDQ4314864
Gang Yu, Olivier Goldschmidt, David Nehme
Publication date: 1 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardset-union knapsackgeneralization of the 0-1 knapsack problemmachine loading in flexible manufacturing systems
Programming involving graphs or networks (90C35) Integer programming (90C10) Dynamic programming (90C39)
Related Items (10)
The knapsack problem with neighbour constraints ⋮ The knapsack problem with forfeit sets ⋮ Adaptive operator selection with reinforcement learning ⋮ Constrained Min-Cut Replication for K-Way Hypergraph Partitioning ⋮ A note on the set union knapsack problem ⋮ The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications ⋮ The complexity of detecting fixed-density clusters ⋮ Algorithms and complexity for a class of combinatorial optimization problems with labelling ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ The incremental connected facility location problem
This page was built for publication:
