Show simple item record

dc.contributor.authorCullenbine, Cullenbine A.
dc.contributor.authorWood, R. Kevin
dc.contributor.authorNewman, Alexandra M.
dc.date.accessioned2014-01-22T19:08:24Z
dc.date.available2014-01-22T19:08:24Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/10945/38427
dc.descriptionNetworks, 62(3), pp. 225-242.en_US
dc.descriptionThe article of record as published may be located at http://dx.doi.org/10.1002/net.21514en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleTheoretical and Computational Advances for Network Diversionen_US
dc.typeArticleen_US
dc.contributor.departmentOperations Research Department
dc.subject.authornetwork diversion; minimum cut; complexity; mixed-integer programming; valid inequalityen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record