Theses and Dissertations
Now showing items 1-2 of 2
A branch-and-bound algorithm for the network diversion problem
(Monterey, California. Naval Postgraduate School, 2002-12)
In the network diversion problem (NDP), we must find a minimum-weight set of edges in a directed graph G = (V,E) whose deletion forces all s-t communication to pass through one or more diversion edges in a diversion set ...
Applying a fix-and-relax heuristic to U.S. Navy force structure planning
(Monterey California. Naval Postgraduate School, 2002-12)
Capital Investment Planning Aid (CIPA) is an optimization-based decision support system created for the U.S. Navy to help plan yearly force structure procurement and retirement. CIPA constraints include yearly industrial ...