Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Q5020876 - MaRDI portal

No label defined (Q5020876)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7453713

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7453713

Statements

scholarly article

0 references

Tanka Nath Dhamala

0 references

Urmila Pyakurel

0 references

0 references

publication date

7 January 2022

0 references

full work available at URL

http://www.orstw.org.tw/ijor/vol15no3/IJOR2018_vol15_no3_p101_p133.pdf

0 references

zbMATH Keywords

network optimization

0 references

dynamic flows

0 references

transportation problems

0 references

evacuation planning

0 references

algorithms

0 references

complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity

0 references

OR/MS research in disaster operations management

0 references

Relief distribution networks: a systematic review

0 references

Extreme Points for Continuous Network Programs with Arc Delays

0 references

Some Properties of a Class of Continuous Linear Programs

0 references

A Class of Continuous Network Flow Problems

0 references

0 references

A continuous-time network simplex algorithm

0 references

A survey of dynamic network flows

0 references

Approximating earliest arrival flows with flow-dependent transit times

0 references

Earliest Arrival Flows with Multiple Sources

0 references

Planning for a bus-based evacuation

0 references

Mathematical models for evacuation planning in urban areas.

0 references

The quickest flow problem

0 references

Time-varying minimum cost flow problems

0 references

Optimal Time-Varying Flows on Congested Networks

0 references

The quickest path problem

0 references

The building evacuation problem with shared information

0 references

An overview of bilevel optimization

0 references

A survey on models and algorithms for discrete evacuation planning network problems

0 references

Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations

0 references

Faster Algorithms for the Quickest Transshipment Problem

0 references

0 references

Quickest Flows Over Time

0 references

Efficient continuous-time dynamic network flow algorithms

0 references

Fast and simple approximation schemes for generalized flow.

0 references

0 references

Constructing Maximal Dynamic Flows from Static Flows

0 references

Maximal Flow Through a Network

0 references

Transient flows in networks

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

A robust bus evacuation model with delayed scenario information

0 references

Branch and bound algorithms for the bus evacuation problem

0 references

Combinatorial Algorithms for the Generalized Circulation Problem

0 references

Finding Minimum-Cost Circulations by Successive Approximation

0 references

Dioïds and semirings: Links to fuzzy sets and other applications

0 references

Geometric algorithms and combinatorial optimization

0 references

Approximating Earliest Arrival Flows in Arbitrary Networks

0 references

Generalized Maximum Flows over Time

0 references

Multicriteria optimization in humanitarian aid

0 references

Optimal dynamic routing in communication networks with continuous traffic

0 references

Multicommodity flows over time: Efficient algorithms and complexity

0 references

An FPTAS for quickest multicommodity flows with inflow-dependent transit times

0 references

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

0 references

A generalized dynamic flows problem

0 references

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

0 references

Algorithms for time-dependent bicriteria shortest path problems

0 references

0 references

On the use of lexicographic min cost flows in evacuation modeling

0 references

The mixed evacuation problem

0 references

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

0 references

A generalization of max flow—min cut

0 references

0 references

The Quickest Transshipment Problem

0 references

On the quickest path problem

0 references

Note—Some Equivalent Objectives for Dynamic Network Flow Problems

0 references

A logistics model for the transport of disaster victims with various injuries and survival probabilities

0 references

Incremental network design with maximum flows

0 references

Abstract flows over time: a first step towards solving dynamic packing problems

0 references

A new approach to the minimum cut problem

0 references

0 references

Minimum-cost dynamic flows: The series-parallel case

0 references

Minimum cost dynamic flows: The series-parallel case

0 references

Continuous and discrete flows over time

0 references

0 references

Flows over Time with Load-Dependent Transit Times

0 references

Time dependency in multiple objective dynamic programming

0 references

Dynamics of disasters -- key concepts, models, algorithms, and insights. Selected papers based on the presentations at the 2nd international conference, Kalamata, Greece, June 29 -- July 2015, 2015

0 references

Generalized max flow in series-parallel graphs

0 references

Finding disjoint paths with different path-costs: Complexity and algorithms

0 references

Covering models and optimization techniques for emergency response facility location and planning: a review

0 references

An optimization approach for real time evacuation reroute planning

0 references

On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach

0 references

Bi‐level programming based contra flow optimization for evacuation events

0 references

A Polynomial Algorithm for Weighted Abstract Flow

0 references

0 references

Combinatorial Optimization with Rational Objective Functions

0 references

Optimal flows in networks with multiple sources and sinks

0 references

On solving quickest time problems in time-dependent, dynamic networks

0 references

Maximal, Lexicographic, and Dynamic Network Flows

0 references

Optimum flows in general communication networks

0 references

Max flows in O(nm) time, or better

0 references

Minimum Convex Cost Dynamic Network Flows

0 references

A comprehensive survey on the quickest path problem

0 references

Continuous-Time Flows in Networks

0 references

An adaptive discretization algorithm for a class of continuous network programs

0 references

A finite-time algorithm for shortest path problems with time-varying costs

0 references

Continuous-time shortest path problems with stopping and starting costs

0 references

0 references

A Study of General Dynamic Network Programs with Arc Time-Delays

0 references

An Algorithm for a Class of Continuous Linear Programs

0 references

Evacuation planning by earliest arrival contraflow

0 references

Continuous time dynamic contraflow models and algorithms

0 references

Continuous dynamic contraflow approach for evacuation planning

0 references

Efficient continuous contraflow algorithms for evacuation planning problems

0 references

Efficient contraflow algorithms for quickest evacuation planning

0 references

0 references

Complexity analysis for maximum flow problems with arc reversals

0 references

Algorithms for the quickest path problem and the enumeration of quickest paths

0 references

Earliest arrival flows on series-parallel graphs

0 references

Evacuation planning using multiobjective evolutionary optimization approach

0 references

Cancel-and-tighten algorithm for quickest flow problems

0 references

Earliest Arrival Flows in Networks with Multiple Sinks

0 references

\(M / G / c / c\) state dependent travel time models and properties

0 references

On the minimization of traffic congestion in road networks with tolls

0 references

Preface: Multiple criteria optimization and goal programming in science, engineering, and social sciences

0 references

A Strongly Polynomial Algorithm for Generalized Flow Maximization

0 references

An Algorithm for Universal Maximal Dynamic Flows in a Network

0 references

A medical resource allocation model for serving emergency victims with deteriorating health conditions

0 references

Reserving relief supplies for earthquake: a multi-attribute decision making of China Red Cross

0 references

Evacuation network optimization model with Lane-based reversal and routing

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5020876

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5020876&oldid=36755222"