Static and dynamic source locations in undirected networks
From MaRDI portal
(Redirected from Publication:889101)
Recommendations
Cites work
- scientific article; zbMATH DE number 1617268 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080258 (Why is no real title available?)
- scientific article; zbMATH DE number 2152473 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A generalization of the weighted set covering problem
- A note on two source location problems
- Algorithmic Aspects of Graph Connectivity
- Algorithms and Computation
- An algorithm for source location in directed graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Constructing maximal dynamic flows from static flows
- Cyclic Scheduling via Integer Programs with Circular Ones
- Exact algorithms and applications for tree-like Weighted Set Cover
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Locating sources to meet flow demands in undirected networks
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
- Maximum-cover source location problems with objective edge-connectivity three
- Minimum Cost Source Location Problems with Flow Requirements
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Minimum cost source location problems with flow requirements
- Minimum transversals in posimodular systems
- Multi-Terminal Network Flows
- Multi-commodity Source Location Problems and Price of Greed
- Network flows. Theory, algorithms, and applications.
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Sink location to find optimal shelters in evacuation planning
- Source location in undirected and directed hypergraphs
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Source location with rigidity and tree packing requirements
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- Transversals of subtree hypergraphs and the source location problem in digraphs
Cited in
(5)- Comments on: ``Static and dynamic source locations in undirected networks
- Rejoinder on: ``Static and dynamic source locations in undirected networks
- The network source location problem: ground state energy, entropy and effects of freezing
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Sink location to find optimal shelters in evacuation planning
This page was built for publication: Static and dynamic source locations in undirected networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889101)
