Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure (Q298932): Difference between revisions

Latest revision as of 13:44, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure	scientific article

Statements

instance of

scholarly article

0 references

title

Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure (English)

0 references

0 references

0 references

Networks and Spatial Economics

0 references

publication date

21 June 2016

0 references

zbMATH Keywords

evacuation planning

0 references

endogenously determined risks

0 references

network flow algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11067-014-9241-y

0 references

cites work

The quickest flow problem

0 references

Modeling of building evacuation problems by network flows with side constraints

0 references

Robust optimization model for a dynamic network design problem under demand uncertainty

0 references

Constructing Maximal Dynamic Flows from Static Flows

0 references

Transient flows in networks

0 references

Note—Some Equivalent Objectives for Dynamic Network Flow Problems

0 references

Evacuation transportation planning under uncertainty: A robust optimization approach

0 references

A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem

0 references

Identifiers

zbMATH Open document ID

1338.90057

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S11067-014-9241-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:298932

@@ Property / DOI @@
-.1007/s11067-014-9241-y
@@ Property / DOI: 10.1007/s11067-014-9241-y / rank @@
-Normal rank
@@ Property / cites work @@
+The quickest flow problem
@@ Property / cites work: The quickest flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling of building evacuation problems by network flows with side constraints
+Normal rank
@@ Property / cites work @@
+Robust optimization model for a dynamic network design problem under demand uncertainty
+Normal rank
@@ Property / cites work @@
+Constructing Maximal Dynamic Flows from Static Flows
+Normal rank
@@ Property / cites work @@
+Transient flows in networks
@@ Property / cites work: Transient flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Note—Some Equivalent Objectives for Dynamic Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Evacuation transportation planning under uncertainty: A robust optimization approach
+Normal rank
@@ Property / cites work @@
+A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
+Normal rank
@@ Property / DOI @@
+.1007/S11067-014-9241-Y
@@ Property / DOI: 10.1007/S11067-014-9241-Y / rank @@
+Normal rank