The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
type: Item
instance of: scholarly article
title: The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
zbMATH Open document ID: 0871.68142
DOI: 10.1016/S0166-218X(96)00015-7
author: David Nehme
author: Gang Yu
published in: Discrete Applied Mathematics
publication date: 1997-05-29T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1004429
zbMATH Keywords: hypergraph
zbMATH Keywords: hyperedges
zbMATH Keywords: dynamic programming
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
cites work: Polyhedral results for the precedence-constrained knapsack problem
cites work: Exact Algorithms For The Setup Knapsack Problem
cites work: Q4314864
cites work: OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
cites work: Q3993418
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
cites work: A strongly polynomial minimum cost circulation algorithm
description: scientific article; zbMATH DE number 1004429