Algorithms for discrete and continuous multicommodity flow network interdiction problems.: An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Thomson Gale on January 1, 2007. The length of the article is 11911 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: Keywords: Network interdiction, bilinear programming, integer programming, multicommodity flows

Citation Details
Title: Algorithms for discrete and continuous multicommodity flow network interdiction problems.
Author: Churlzu Lim
Publication:IIE Transactions (Magazine/Journal)
Date: January 1, 2007
Publisher: Thomson Gale
Volume: 39 Issue: 1 Page: 15(12)

Distributed by Thomson Gale