Cancel-and-tighten algorithm for quickest flow problems

DOI10.1002/NET.21726MaRDI QIDQ4565782zbMATH OpenOpenAlexFDO

Authors Masahide Saho, Maiko Shigeno

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21726

zbMATH Keywords

cancel and tighten algorithmcost scalingdynamic flownetwork optimizationquickest flowstrongly polynomial time algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• The quickest flow problem
• The quickest path problem
• An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
• scientific article; zbMATH DE number 1303551

Cited in

(16)

• Efficient contraflow algorithms for quickest evacuation planning
• The mixed evacuation problem
• Discrete Newton methods for the evacuation problem
• Dynamic network flow location models and algorithms for quickest evacuation planning
• The quickest flow problem
• A critical survey on the network optimization algorithms for evacuation planning problems
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• Minimum‐cost flow problems having arc‐activation costs
• A note on the quickest minimum cost transshipment problem
• Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
• The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
• Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
• On the approximability of train routing and the min-max disjoint paths problem
• A faster parametric search for the integral quickest transshipment problem

This page was built for publication: Cancel-and-tighten algorithm for quickest flow problems

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