Rational solutions of the graphsack problem

DOI10.1007/BF02612338zbMath0532.90069MaRDI QIDQ3315278

Gottfried Tinhofer

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

efficient algorithmoptimality criterionbinary linear optimizationpolynomially bounded algorithmsoptimal network designaugmenting cutscompressed solutionsconstraints with tree structurerational graphsack problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)

Related Items (1)

An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• Approximative Algorithms for Discrete Optimization Problems

This page was built for publication: Rational solutions of the graphsack problem