Rational solutions of the graphsack problem

DOI10.1007/BF02612338MaRDI QIDQ3315278zbMATH OpenFDO

Authors Gottfried Tinhofer

Publication date 1984

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02612338

zbMATH Keywords

augmenting cutsbinary linear optimizationcompressed solutionsconstraints with tree structureefficient algorithmoptimal network designoptimality criterionpolynomially bounded algorithmsrational graphsack problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3867066
• Combinatorial optimization with rational objective functions
• scientific article; zbMATH DE number 482901
• scientific article; zbMATH DE number 4162902
• Sparsest cuts and bottlenecks in graphs

Cites work

• Approximate Algorithms for the 0/1 Knapsack Problem
• Approximative Algorithms for Discrete Optimization Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 3756239 (Why is no real title available?)
• scientific article; zbMATH DE number 3637598 (Why is no real title available?)

Cited in

(3)

• An O(n^ 2) simplex algorithm for a class of linear programs with tree structure
• scientific article; zbMATH DE number 3867066 (Why is no real title available?)
• Bag rationalisation for a food manufacturer

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315278)