scientific article; zbMATH DE number 1927152

MaRDI QIDQ4707980zbMATH OpenFDO

Authors Jun Han, Graham B. McMahon, Stephen J. Sugden

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2412/24120167.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 556046
• An improved branch and bound algorithm for minimum concave cost network flow problems
• scientific article; zbMATH DE number 2090612
• A branch-and-bound algorithm for concave network flow problems
• Multicommodity flows in tree-like networks

Cited in

(7)

• On a class of branching problems in broadcasting and distribution
• A network simplex algorithm for solving the minimum distribution cost problem
• A branch-and-bound algorithm for concave network flow problems
• scientific article; zbMATH DE number 150473 (Why is no real title available?)
• An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
• scientific article; zbMATH DE number 5173820 (Why is no real title available?)
• A branch-and-cut approach for minimum cost multi-level network design

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 Q4707980)