Given a network, G=[N,E] the Isolation Set Problem (ISP) finds the set of arcs, D⊆E, that when removed will separate a predefined set of r distinguished nodes [2]. This involves eliminating connections from a specific set of nodes to the rest of a network. In our increasingly interconnected...

Scheduling is a time and labor-intensive task. In addition, problems arise due to the lag time between the publication of the schedule and the start of the scheduled work period. During this time, conditions in the dynamic environment can, and often do, change (equipment breaks, orders are...

The class of generalized pattern search (GPS) algorithms for mixed variable optimization is extended to problems with stochastic objective functions. Because random noise in the objective function makes it more difficult to compare trial points and ascertain which points are truly better than...