A heuristic for constructing surrogate constraints for the linear zero-one integer programming problem
Giordano, Frank R.
MetadataShow full item record
In this report the author presents a heuristic for constructing surrogate constraints to be used for the solution of the linear zero-one integer problem. Using the heuristic the author was able to build surrogate constraints with strength comparable to the dual multiplier surrogate in one-tenth the time. (Author)
NPS Report NumberNPS55-82-009
Showing items related by title, author, creator and subject.
Salmeron, Javier; Wood, R. Kevin; Baldick, Ross (Monterey, California. Naval Postgraduate School, 2004); NPS-OR-04-001This research extends our earlier work to improve the security of electric power grids subject to disruptions caused by terrorist attacks. To identify critical system components (e.g., transmission lines, generators, ...
McNary, Bradley S. (Monterey California. Naval Postgraduate School, 2008-03);Within the past 50 years, containerization and globalization have driven a change from small container terminals to large container terminals that need efficient logistic models to keep up with the significant growth in ...
Gray, Matthew D. (Monterey, California: Naval Postgraduate School, 2015-09);With the assignment of the last available blocks of public IPv4 addresses from Internet Assigned Numbers Authority, there is continued pressure for widespread IPv6 adoption. Because the IPv6 address space is orders of ...