Rational solutions of the graphsack problem
From MaRDI portal
Publication:3315278
DOI10.1007/BF02612338zbMath0532.90069MaRDI QIDQ3315278
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
efficient algorithm; optimality criterion; binary linear optimization; polynomially bounded algorithms; optimal network design; augmenting cuts; compressed solutions; constraints with tree structure; rational graphsack problems
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C05: Linear programming
90C09: Boolean programming
Related Items
Cites Work