Publisher Summary Trees are particular types of graphs that on the surface appear to be
quite specialized, so much so that they might not seem to merit in-depth investigation. Tree …

Publisher Summary This chapter discusses several applications of the following network
optimization problems: shortest paths, maximum flows, minimum cost flows, assignment and …

Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and
discrete/combinatorial network optimization problems, their applications, and their analytical …

Survivable Networks: Algorithms for Diverse Routing provides algorithms for diverse routing
to enhance the survivability of a network. It considers the common mesh-type network and …

This survey presents cutting planes that are useful or potentially useful in solving mixed
integer programs. Valid inequalities for (i) general integer programs,(ii) problems with local …

The primal-dual method is a standard tool in the design of algorithms for combinatorial
optimization problems. This chapter shows how the primal-dual method can be modi ed to …

We define a connection subgraph as a small subgraph of a large graph that best captures
the relationship between two nodes. The primary motivation for this work is to provide a …

Freight transportation is a vital component of the economy. It supports production, trade, and
consumption activities by ensuring the efficient movement and timely availability of raw …

Connections between individuals facilitate the exchange of goods, resources, and
information and create benefits. These connections may be exploited by adversaries to …