Locating sources to meet flow demands in undirected networks

DOI10.1007/3-540-44985-X_27MaRDI QIDQ2721990zbMATH OpenFDO

Authors Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44985-X_27

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Locating sources to meet flow demands in undirected networks
• Minimum cost source location problem with local 3-vertex-connectivity requirements
• scientific article; zbMATH DE number 2152473
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• A note on two source location problems

Cited in

(8)

• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Locating sources to meet flow demands in undirected networks
• Sink location to find optimal shelters in evacuation planning
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Minimizing the expense transmission time from the source node to demand nodes
• Static and dynamic source locations in undirected networks
• Source location in undirected and directed hypergraphs

This page was built for publication: Locating sources to meet flow demands in undirected networks

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