#### Filter Results:

#### Publication Year

1999

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Kenneth R. Baker, Jonathan Cole Smith
- J. Scheduling
- 2003

- Churlzu Lim, J. Cole Smith
- 2005

We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or " interdicting ") arcs, and each arc is associated with a… (More)

- Jonathan Cole Smith, Andrew J. Schaefer, Joyce W. Yen
- Networks
- 2004

We develop stochastic integer programming techniques tailored toward solving a Synchronous Optical Network (SONET) ring design problem with uncertain demands. Our approach is based on an L-shaped algorithm, whose (integer) master program prescribes a candidate network design, and whose (continuous) subproblems relay information regarding potential shortage… (More)

- Hanif D. Sherali, Jonathan Cole Smith
- Optimization Letters
- 2007

We present a new linearized model for the zero-one quadratic programming problem, whose size is linear in terms of the number of variables in the original nonlinear problem. Our derivation yields three alternative reformulations, each varying in model size and tightness. We show that our models are at least as tight as the one recently proposed by… (More)

- Jennifer A. Horne, Jonathan Cole Smith
- Networks
- 2005

- Hanif D. Sherali, Jonathan Cole Smith
- Management Science
- 2001

In a multifunction radar, the maximum number of targets which can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead-times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the… (More)

- April K. Andreas, Jonathan Cole Smith
- Networks
- 2009

- Hanif D. Sherali, Jonathan Cole Smith, Antonio A. Trani, Srinivas Sale
- Transportation Science
- 2000

- Behnam Behdani, Jonathan Cole Smith
- INFORMS Journal on Computing
- 2014

We address a variant of the Traveling Salesman Problem known as the Close-Enough Trav-eling Salesman Problem (CETSP), where the traveler visits a node if it enters a compact neighborhood set of that node. We formulate a mixed-integer programming model based on a discretization scheme for the problem. Both lower and upper bounds on the optimal CETSP tour… (More)