Zobrazeno 1 - 3
of 3
pro vyhledávání: '"David Nehme"'
The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
Autor:
David Nehme, Gang Yu
Publikováno v:
Discrete Applied Mathematics. 74(1):57-68
Given a hypergraph with values on the hyperedges, the problem of finding a subhypergraph of maximum value subject to cardinality and precedence constraints on the nodes has applications ranging from partitioning fields in a database, to loading tools
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f04fb786d784fe49e0e5dad714decf1
Publikováno v:
Naval Research Logistics. 41:833-842
The 0-1 knapsack problem can be defined as follows. Given a set of items, select the subset with largest total value, subject to the constraint that the total weight of the items selected does not exceed a fixed capacity. The total value of a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33cab33bf99690f21204eaa5c6b66dda
https://doi.org/10.1002/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co
https://doi.org/10.1002/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.