scientific article; zbMATH DE number 3848941

MaRDI QIDQ3318501zbMATH OpenFDO

Authors Peter Brucker

Publication date 1982

zbMATH Keywords

algorithmsflows in treesknapsack problemsnested constraints

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• On an optimization problem with nested constraints
• scientific article; zbMATH DE number 3864952
• Multicommodity flows in tree-like networks
• scientific article; zbMATH DE number 1091558
• scientific article; zbMATH DE number 3850794

Cited in

(9)

• Minimum cost flow algorithms for series-parallel networks
• Greedy concepts for network flow problems
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• scientific article; zbMATH DE number 4112385 (Why is no real title available?)
• scientific article; zbMATH DE number 910923 (Why is no real title available?)
• On an optimization problem with nested constraints
• Flow trees for vertex-capacitated networks

This page was built for publication:

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