scientific article; zbMATH DE number 934458

zbMATH Open0856.60091MaRDI QIDQ4895155FDOQ4895155

Authors: Edward J. Anderson, A. B. Philpott 

Publication date: 17 February 1997

Title of this publication is not available (Why is that?)

Recommendations

• Dynamic flows in networks
• Optimal flows in dynamic networks and algorithms for their finding
• Dynamic flows in time-varying networks.
• Flows over time in time-varying networks: optimality conditions and strong duality
• Time-varying network optimization.

zbMATH Keywords

optimization problemsnetwork flow problemsoptimization under constraints

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (29)

• On continuous network flows
• Generalized Maximum Flows over Time
• Existence and Uniqueness of Equilibria for Flows over Time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Postoptimizing equilibrium flows on large scale networks
• Maximum contraflow evacuation planning problems on multi-network
• Modelling and optimisation of flows on networks. Cetraro, Italy 2009. Papers based on the presentations at the CIME course, June 15--19, 2009
• Determining the optimal flows in zero-time dynamic networks
• Optimal Flows in Stochastic Dynamic Networks with Congestion
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• Flows over time in time-varying networks: optimality conditions and strong duality
• Title not available (Why is that?)
• Efficient continuous-time dynamic network flow algorithms
• Continuous dynamic contraflow approach for evacuation planning
• Efficient contraflow algorithms for quickest evacuation planning
• Long-term behavior of dynamic equilibria in fluid queuing networks
• A critical survey on the network optimization algorithms for evacuation planning problems
• Bicriteria Nash flows over time
• Dynamic network contraflow evacuation planning problem with continuous time approach
• Temporal network optimization subject to connectivity constraints
• On solving continuous-time dynamic network flows
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• Dynamic equilibria in fluid queueing networks
• Time-varying network optimization.
• An introduction to network flows over time
• On the price of anarchy for flows over time
• A dual framework for time-variant network decision problems

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