Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. - Hanif D. Sherali; Jonathan Cole Smith; Warren P. Adams (Discret. Appl. Math., 2000)

Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting. - Hanif D. Sherali; J. Cole Smith; Youngho Lee (INFORMS J. Comput., 2000)

National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm. - Hanif D. Sherali; J. Cole Smith; Antonio A. Trani; Srinivas Sale (Transp. Sci., 2000)

Convex hull representations of models for computing collisions between multiple bodies. - Hanif D. Sherali; J. Cole Smith; Shokri Z. Selim (Eur. J. Oper. Res., 2001)

Improving Discrete Model Representations via Symmetry Considerations. - Hanif D. Sherali; J. Cole Smith (Manag. Sci., 2001)

Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems. - J. Cole Smith (2001)

An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations. - Hanif D. Sherali; J. Cole Smith; Antonio A. Trani (Transp. Sci., 2002)

A Multiple-Criterion Model for Machine Scheduling. - Kenneth R. Baker; J. Cole Smith (J. Sched., 2003)

The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks. - Enock Chisonge Mofya; Jonathan Cole Smith (ISI, 2004)

Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. - J. Cole Smith (Eur. J. Oper. Res., 2004)

A stochastic integer programming approach to solving a synchronous optical network ring design problem. - J. Cole Smith; Andrew J. Schaefer; Joyce W. Yen (Networks, 2004)

A class of web-based facets for the generalized vertex packing problem. - Hanif D. Sherali; J. Cole Smith (Discret. Appl. Math., 2005)

Interleaving two-phased jobs on a single machine. - Hanif D. Sherali; J. Cole Smith (Discret. Optim., 2005)

An Analysis of the Alias Method for Discrete Random-Variate Generation. - J. Cole Smith; Sheldon H. Jacobson (INFORMS J. Comput., 2005)

Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. - Jennifer A. Horne; J. Cole Smith (Networks, 2005)

A dynamic programming algorithm for the conditional covering problem on tree graphs. - Jennifer A. Horne; J. Cole Smith (Networks, 2005)

Sequential Search with Multiattribute Options. - Churlzu Lim; J. Neil Bearden; J. Cole Smith (Decis. Anal., 2006)

A bracket assignment problem for the National Collegiate Athletic Association Men's Basketball Tournament. - J. Cole Smith; Barbara M. P. Fraticelli; Chase Rainwater (Int. Trans. Oper. Res., 2006)

Exact and heuristic algorithms for solving the generalized minimum filter placement problem. - Enock Chisonge Mofya; J. Cole Smith (J. Comb. Optim., 2006)

A polyhedral study of the generalized vertex packing problem. - Hanif D. Sherali; J. Cole Smith (Math. Program., 2006)

A packet filter placement problem with application to defense against spoofed denial of service attacks. - Benjamin Armbruster; J. Cole Smith; Kihong Park (Eur. J. Oper. Res., 2007)

Survivable network design under optimal and heuristic interdiction scenarios. - J. Cole Smith; Churlzu Lim; Fransisca Sudargho (J. Glob. Optim., 2007)

An improved linearization strategy for zero-one quadratic programming problems. - Hanif D. Sherali; J. Cole Smith (Optim. Lett., 2007)

On the multi-attribute stopping problem with general value functions. - J. Cole Smith; Churlzu Lim; J. Neil Bearden (Oper. Res. Lett., 2007)

Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations. - April K. Andreas; J. Cole Smith (INFORMS J. Comput., 2008)

Optimization Support for Senior Design Project Assignments. - Leo Lopes; Meredith Aronson; Gary Carstensen; J. Cole Smith (Interfaces, 2008)

Branch-and-price-and-cut algorithms for solving the reliable h -paths problem. - April K. Andreas; J. Cole Smith; Simge Küçükyavuz (J. Glob. Optim., 2008)

Preface. - J. Cole Smith (Networks, 2008)

Cutting plane algorithms for solving a stochastic edge-partition problem. - Z. Caner Taskin; J. Cole Smith; Shabbir Ahmed 001; Andrew J. Schaefer (Discret. Optim., 2009)

A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures. - Enock Chisonge Mofya; J. Cole Smith (INFORMS J. Comput., 2009)

Two-stage stochastic hierarchical multiple risk problems: models and algorithms. - Hanif D. Sherali; J. Cole Smith (Math. Program., 2009)

Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network. - April K. Andreas; J. Cole Smith (Networks, 2009)

An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models. - Dale Henderson; J. Cole Smith (Optim. Methods Softw., 2009)

Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning. - Z. Caner Taskin; J. Cole Smith; H. Edwin Romeijn; James F. Dempsey (Oper. Res., 2010)

Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths. - Siqian Shen; J. Cole Smith; Shabbir Ahmed 001 (Manag. Sci., 2010)

Finite Optimal Stopping Problems: The Seller’s Perspective. - Mehdi Hemmati; J. Cole Smith (J. Probl. Solving, 2011)

Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. - Z. Caner Taskin; J. Cole Smith; H. Edwin Romeijn (Ann. Oper. Res., 2012)

A combinatorial optimization algorithm for solving the branchwidth problem. - J. Cole Smith; Elif Ulusal; Illya V. Hicks (Comput. Optim. Appl., 2012)

Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks. - Behnam Behdani; YoungSang Yun; J. Cole Smith; Ye Xia 001 (Comput. Oper. Res., 2012)

Exact interdiction models and algorithms for disconnecting networks via node deletions. - Siqian Shen; J. Cole Smith; Roshan Goli (Discret. Optim., 2012)

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. - Siqian Shen; J. Cole Smith (Networks, 2012)

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. - Hanif D. Sherali; J. Cole Smith (Optim. Lett., 2012)

A decomposition approach for solving a broadcast domination network design problem. - Siqian Shen; J. Cole Smith (Ann. Oper. Res., 2013)

Integer programming models and algorithms for the graph decontamination problem with mobile agents. - John Penuel; J. Cole Smith; Siqian Shen (Networks, 2013)

Distributed Algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink. - YoungSang Yun; Ye Xia 001; Behnam Behdani; J. Cole Smith (IEEE Trans. Mob. Comput., 2013)

A cutting-plane algorithm for solving a weighted influence interdiction problem. - Mehdi Hemmati; J. Cole Smith; My T. Thai (Comput. Optim. Appl., 2014)

An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem. - Behnam Behdani; J. Cole Smith (INFORMS J. Comput., 2014)

Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations. - Bita Tadayon; J. Cole Smith (J. Optim. Theory Appl., 2014)

Convex hull representation of the deterministic bipartite network interdiction problem. - Kelly M. Sullivan; J. Cole Smith; David P. Morton (Math. Program., 2014)

Exact algorithms for solving a Euclidean maximum flow network interdiction problem. - Kelly M. Sullivan; J. Cole Smith (Networks, 2014)

A branch-and-price-and-cut method for computing an optimal bramble. - Sibel B. Sonuc; J. Cole Smith; Illya V. Hicks (Discret. Optim., 2015)

On a Random Walk Survivability problem with arc failures and memory. - Burak Büke; J. Cole Smith; Sadie Thomas (Networks, 2015)

Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems. - Bita Tadayon; J. Cole Smith (J. Sched., 2015)

A survey of optimization algorithms for wireless sensor network lifetime maximization. - Robert M. Curry; J. Cole Smith (Comput. Ind. Eng., 2016)

A mixed-integer bilevel programming approach for a competitive prioritized set covering problem. - Mehdi Hemmati; J. Cole Smith (Discret. Optim., 2016)

Preface. - Warren P. Adams; Suvrajeet Sen; J. Cole Smith (J. Glob. Optim., 2016)

A class of algorithms for mixed-integer bilevel min-max optimization. - Yen Tang; Jean-Philippe P. Richard; J. Cole Smith (J. Glob. Optim., 2016)

Dynamic shortest-path interdiction. - Jorge A. Sefair; J. Cole Smith (Networks, 2016)

A Backward Sampling Framework for Interdiction Problems with Fortification. - Leonardo Lozano; J. Cole Smith (INFORMS J. Comput., 2017)

A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem. - Leonardo Lozano; J. Cole Smith (Oper. Res., 2017)

Branch-cut-price algorithms for solving a class of search problems on general graphs. - Z. Caner Taskin; J. Cole Smith (Networks, 2017)

Solving the traveling salesman problem with interdiction and fortification. - Leonardo Lozano; J. Cole Smith; Mary E. Kurz (Oper. Res. Lett., 2017)

Partial objective inequalities for the multi-item capacitated lot-sizing problem. - I. Esra Büyüktahtakin; J. Cole Smith; Joseph C. Hartman (Comput. Oper. Res., 2018)

Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations. - Tim Holzmann; J. Cole Smith (Eur. J. Oper. Res., 2018)

In Memoriam: Shabbir Ahmed (1969-2019). - J. Cole Smith (INFORMS J. Comput., 2019)

A survey of network interdiction models and algorithms. - J. Cole Smith; Yongjia Song (Eur. J. Oper. Res., 2020)

On the Consistent Path Problem. - Leonardo Lozano; David Bergman; J. Cole Smith (Oper. Res., 2020)

The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms. - Tim Holzmann; J. Cole Smith (Oper. Res., 2021)

Preface. - S. Raghavan 001; J. Cole Smith (Networks, 2021)

Network interdiction with asymmetric cost uncertainty. - Di H. Nguyen; J. Cole Smith (Eur. J. Oper. Res., 2022)

A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. - Leonardo Lozano; J. Cole Smith (Math. Program., 2022)

An augmenting-flow algorithm for a class of node-capacitated maximum flow problems. - Robert M. Curry; J. Cole Smith (Networks, 2022)

On Aligning Non-Order-Associated Binary Decision Diagrams. - Alexey A. Bochkarev; J. Cole Smith (INFORMS J. Comput., 2023)

A two-stage network interdiction-monitoring game. - Di H. Nguyen; Yongjia Song; J. Cole Smith (Networks, 2023)

Monte Carlo tree search for dynamic shortest-path interdiction. - Alexey A. Bochkarev; J. Cole Smith (Networks, 2024)