The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications

DOI10.1016/S0166-218X(96)00015-7zbMath0871.68142MaRDI QIDQ678869

Gang Yu, David Nehme

Publication date: 29 May 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

hypergraphdynamic programmingpolynomial-time algorithmhyperedges

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Related Items

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, The complexity of detecting fixed-density clusters

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• Polyhedral results for the precedence-constrained knapsack problem
• OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Exact Algorithms For The Setup Knapsack Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• A Selection Problem of Shared Fixed Costs and Network Flows