Optimal flow trees for networks with general nonlinear arc costs

zbMATH Open1138.90344MaRDI QIDQ5448010FDOQ5448010

Authors: Dalila B. M. M. Fontes 

Publication date: 20 March 2008

Recommendations

• scientific article; zbMATH DE number 1984104
• scientific article; zbMATH DE number 3850794
• scientific article; zbMATH DE number 3864952
• scientific article; zbMATH DE number 35513
• Finding minimum cost directed trees with demands and capacities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (5)

• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
• Minimax flow tree problems
• Title not available (Why is that?)
• A network flow approach to cost allocation for rooted trees
• A novel approach to subgraph selection with multiple weights on arcs

Uses Software

• OR-Library

This page was built for publication: Optimal flow trees for networks with general nonlinear arc costs

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