Efficient Formulations for Multiple Allocation Hub Network Interdiction Problems

In this paper, we study a network interdiction problem on a multiple allocation, uncapacitated hub network. The problem is formulated as a bilevel Stackelberg game between an attacker and a defender, where the attacker identifies r out of p hubs to interdict so as to maximize the worst-case post-interdiction performance of the system with the … Read more

The Multi-Hour Bandwidth Packing Problem with Queuing Delays: Bounds and Exact Solution Approach

The multi-hour bandwidth packing problem arises in telecommunication networks that span several time horizon. The problem seeks to select and route a set of messages from a given list of messages with prespecified requirement on demand for bandwidth under time varying traffic conditions on an undirected communication network such that the total profit is maximized. … Read more

Location and Allocation of Service Units on a Congested Network with Time Varying Demand Rates

The service system design problem arises in the design of telecommunication networks, refuse collection and disposal networks in public sector, transportation planning, and location of emergency medical facilities. The problem seeks to locate service facilities, determine their capacities and assign users to those facilities under time varying demand conditions. The objective is to minimize total … Read more