Commodity Prioritized Maximum Dynamic Multi-Commodity Flow Problem

Due to different disasters, natural or men made, world is facing the problem of massive damage of life and property. To save the life of maximum number of evacuees, an efficient evacuation planning is essential. Prioritization is the process of deciding the relative importance or urgency of things or objects. It helps to focus on … Read more

The Maximum Flow Network Interdiction Problem: Valid Inequalities, Integrality Gaps, and Approximability

We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integrality gap of the LP relaxation of Wood’s (1993) integer program is not bounded by a constant factor, even when the LP relaxation is strengthened by our valid inequalities. Finally, … Read more

Rapidly Solving an Online Sequence of Maximum Flow Problems

We investigate how to rapidly solve an online sequence of maximum flow problems. Sequences of maximum flow problems arise in a diverse collection of settings, including stochastic network programming and real-time scheduling of jobs on a two-processor computer. In this paper, we formulate solving an online sequence of maximum flow problems as the Maximum Flow … Read more