Solving the Bi-objective Maximum-Flow Network-Interdiction Problem

Thumbnail Image
Files
RoysetWood_JOC2007_journalFormatE.pdf (205.38 KB)
Authors
Royset, Johannes O.
Wood, R. Kevin
Subjects
interdiction; maximum flow; Lagrangian relaxation; cut enumeration
Advisors
Date of Issue
2007
Date
Spring 2007
Publisher
Language
Abstract
Type
Article
Description
INFORMS Journal on Computing, Vol. 19, No. 2, pp. 175-184.
The article of record as published may be located at http://dx.doi.org/10.1287/ijoc.1060.0191
URI
https://hdl.handle.net/10945/38232
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
J.O. Royset and R.K. Wood, 2007, ﾓSolving the Bi-objective Maximum-Flow Network-Interdiction Problem,ﾔ INFORMS Journal on Computing, Vol. 19, No. 2, pp. 175-184.
Distribution Statement
Rights
This 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.
Collections
Publications