Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Cole Smith
Person information
- affiliation: Syracuse University, NY, USA
- affiliation (former): Clemson University, Department of Industrial Engineering, SC, USA
- affiliation (former): University of Arizona, Department of Systems and Industrial Engineering, Tucson, AZ, USA
- affiliation (former): University of Florida, Department of Industrial and Systems Engineering, Gainesville, FL, USA
- affiliation (PhD 2000): Virginia Tech, Department of Industrial and Systems Engineering, Blacksburg, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j72]Di H. Nguyen
, Yongjia Song, J. Cole Smith:
A two-stage network interdiction-monitoring game. Networks 81(3): 334-358 (2023)- 2022
- [j71]Di H. Nguyen, J. Cole Smith:
Network interdiction with asymmetric cost uncertainty. Eur. J. Oper. Res. 297(1): 239-251 (2022) - [j70]Leonardo Lozano, J. Cole Smith:
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. 191(1): 381-404 (2022) - [j69]Robert M. Curry, J. Cole Smith:
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems. Networks 80(1): 109-122 (2022) - 2021
- [j68]Tim Holzmann, J. Cole Smith:
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms. Oper. Res. 69(1): 82-99 (2021) - [j67]S. Raghavan, J. Cole Smith:
Preface. Networks 77(1): 3-4 (2021) - [j66]S. Raghavan, J. Cole Smith:
Preface. Networks 77(2): 175-176 (2021) - 2020
- [j65]J. Cole Smith, Yongjia Song:
A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3): 797-811 (2020) - [j64]Leonardo Lozano, David Bergman, J. Cole Smith:
On the Consistent Path Problem. Oper. Res. 68(6): 1913-1931 (2020)
2010 – 2019
- 2019
- [j63]J. Cole Smith:
In Memoriam: Shabbir Ahmed (1969-2019). INFORMS J. Comput. 31(4): 633-635 (2019) - 2018
- [j62]I. Esra Büyüktahtakin, J. Cole Smith, Joseph C. Hartman:
Partial objective inequalities for the multi-item capacitated lot-sizing problem. Comput. Oper. Res. 91: 132-144 (2018) - [j61]Tim Holzmann, J. Cole Smith:
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations. Eur. J. Oper. Res. 271(2): 436-449 (2018) - 2017
- [j60]Leonardo Lozano, J. Cole Smith:
A Backward Sampling Framework for Interdiction Problems with Fortification. INFORMS J. Comput. 29(1): 123-139 (2017) - [j59]Leonardo Lozano, J. Cole Smith:
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem. Oper. Res. 65(3): 768-786 (2017) - [j58]Z. Caner Taskin, J. Cole Smith:
Branch-cut-price algorithms for solving a class of search problems on general graphs. Networks 70(1): 4-18 (2017) - [j57]Leonardo Lozano, J. Cole Smith, Mary E. Kurz:
Solving the traveling salesman problem with interdiction and fortification. Oper. Res. Lett. 45(3): 210-216 (2017) - 2016
- [j56]Robert M. Curry, J. Cole Smith:
A survey of optimization algorithms for wireless sensor network lifetime maximization. Comput. Ind. Eng. 101: 145-166 (2016) - [j55]Mehdi Hemmati, J. Cole Smith:
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem. Discret. Optim. 20: 105-134 (2016) - [j54]Warren P. Adams, Suvrajeet Sen, J. Cole Smith:
Preface. J. Glob. Optim. 66(2): 151-152 (2016) - [j53]Yen Tang, Jean-Philippe P. Richard, J. Cole Smith:
A class of algorithms for mixed-integer bilevel min-max optimization. J. Glob. Optim. 66(2): 225-262 (2016) - [j52]Jorge A. Sefair, J. Cole Smith:
Dynamic shortest-path interdiction. Networks 68(4): 315-330 (2016) - 2015
- [j51]Sibel B. Sonuc, J. Cole Smith, Illya V. Hicks:
A branch-and-price-and-cut method for computing an optimal bramble. Discret. Optim. 18: 168-188 (2015) - [j50]Burak Büke, J. Cole Smith, Sadie Thomas:
On a Random Walk Survivability problem with arc failures and memory. Networks 66(1): 67-86 (2015) - [j49]Bita Tadayon, J. Cole Smith:
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems. J. Sched. 18(6): 575-592 (2015) - 2014
- [j48]Mehdi Hemmati, J. Cole Smith, My T. Thai:
A cutting-plane algorithm for solving a weighted influence interdiction problem. Comput. Optim. Appl. 57(1): 71-104 (2014) - [j47]Behnam Behdani, J. Cole Smith:
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 26(3): 415-432 (2014) - [j46]Bita Tadayon, J. Cole Smith:
Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations. J. Optim. Theory Appl. 161(2): 506-532 (2014) - [j45]Kelly M. Sullivan, J. Cole Smith, David P. Morton:
Convex hull representation of the deterministic bipartite network interdiction problem. Math. Program. 145(1-2): 349-376 (2014) - [j44]Kelly M. Sullivan, J. Cole Smith:
Exact algorithms for solving a Euclidean maximum flow network interdiction problem. Networks 64(2): 109-124 (2014) - 2013
- [j43]Siqian Shen, J. Cole Smith:
A decomposition approach for solving a broadcast domination network design problem. Ann. Oper. Res. 210(1): 333-360 (2013) - [j42]John Penuel, J. Cole Smith, Siqian Shen:
Integer programming models and algorithms for the graph decontamination problem with mobile agents. Networks 61(1): 1-19 (2013) - [j41]YoungSang Yun, Ye Xia, Behnam Behdani, J. Cole Smith:
Distributed Algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink. IEEE Trans. Mob. Comput. 12(10): 1920-1930 (2013) - 2012
- [j40]Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn:
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. Ann. Oper. Res. 196(1): 799-818 (2012) - [j39]J. Cole Smith, Elif Ulusal, Illya V. Hicks:
A combinatorial optimization algorithm for solving the branchwidth problem. Comput. Optim. Appl. 51(3): 1211-1229 (2012) - [j38]Behnam Behdani, YoungSang Yun, J. Cole Smith, Ye Xia:
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks. Comput. Oper. Res. 39(5): 1054-1061 (2012) - [j37]Siqian Shen, J. Cole Smith, Roshan Goli:
Exact interdiction models and algorithms for disconnecting networks via node deletions. Discret. Optim. 9(3): 172-188 (2012) - [j36]Siqian Shen, J. Cole Smith:
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2): 103-119 (2012) - [j35]Hanif D. Sherali, J. Cole Smith:
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. Optim. Lett. 6(1): 127-139 (2012) - 2011
- [j34]Mehdi Hemmati, J. Cole Smith:
Finite Optimal Stopping Problems: The Seller’s Perspective. J. Probl. Solving 3(2) (2011) - 2010
- [j33]Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn, James F. Dempsey:
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning. Oper. Res. 58(3): 674-690 (2010) - [j32]Siqian Shen, J. Cole Smith, Shabbir Ahmed:
Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths. Manag. Sci. 56(10): 1794-1814 (2010) - [c2]YoungSang Yun, Ye Xia, Behnam Behdani, J. Cole Smith:
Distributed algorithm for lifetime maximization in delay-tolerant wireless sensor network with mobile sink. CDC 2010: 370-375
2000 – 2009
- 2009
- [j31]Z. Caner Taskin, J. Cole Smith, Shabbir Ahmed, Andrew J. Schaefer:
Cutting plane algorithms for solving a stochastic edge-partition problem. Discret. Optim. 6(4): 420-435 (2009) - [j30]Enock Chisonge Mofya, J. Cole Smith:
A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures. INFORMS J. Comput. 21(2): 322-332 (2009) - [j29]Hanif D. Sherali, J. Cole Smith:
Two-stage stochastic hierarchical multiple risk problems: models and algorithms. Math. Program. 120(2): 403-427 (2009) - [j28]April K. Andreas, J. Cole Smith:
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network. Networks 53(2): 91-103 (2009) - [j27]Dale Henderson, J. Cole Smith:
An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models. Optim. Methods Softw. 24(4-5): 857-870 (2009) - 2008
- [j26]April K. Andreas, J. Cole Smith:
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations. INFORMS J. Comput. 20(4): 553-564 (2008) - [j25]Leo Lopes, Meredith Aronson, Gary Carstensen, J. Cole Smith:
Optimization Support for Senior Design Project Assignments. Interfaces 38(6): 448-464 (2008) - [j24]April K. Andreas, J. Cole Smith, Simge Küçükyavuz:
Branch-and-price-and-cut algorithms for solving the reliable h -paths problem. J. Glob. Optim. 42(4): 443-466 (2008) - [j23]J. Cole Smith:
Preface. Networks 52(3): 109-110 (2008) - 2007
- [j22]Benjamin Armbruster, J. Cole Smith, Kihong Park:
A packet filter placement problem with application to defense against spoofed denial of service attacks. Eur. J. Oper. Res. 176(2): 1283-1292 (2007) - [j21]J. Cole Smith, Churlzu Lim, Fransisca Sudargho:
Survivable network design under optimal and heuristic interdiction scenarios. J. Glob. Optim. 38(2): 181-199 (2007) - [j20]Hanif D. Sherali, J. Cole Smith:
An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1(1): 33-47 (2007) - [j19]J. Cole Smith, Churlzu Lim, J. Neil Bearden:
On the multi-attribute stopping problem with general value functions. Oper. Res. Lett. 35(3): 324-330 (2007) - 2006
- [j18]Churlzu Lim, J. Neil Bearden, J. Cole Smith:
Sequential Search with Multiattribute Options. Decis. Anal. 3(1): 3-15 (2006) - [j17]J. Cole Smith, Barbara M. P. Fraticelli, Chase Rainwater:
A bracket assignment problem for the National Collegiate Athletic Association Men's Basketball Tournament. Int. Trans. Oper. Res. 13(3): 253-271 (2006) - [j16]Enock Chisonge Mofya, J. Cole Smith:
Exact and heuristic algorithms for solving the generalized minimum filter placement problem. J. Comb. Optim. 12(3): 231-256 (2006) - [j15]Hanif D. Sherali, J. Cole Smith:
A polyhedral study of the generalized vertex packing problem. Math. Program. 107(3): 367-390 (2006) - 2005
- [j14]Hanif D. Sherali, J. Cole Smith:
A class of web-based facets for the generalized vertex packing problem. Discret. Appl. Math. 146(3): 273-286 (2005) - [j13]Hanif D. Sherali, J. Cole Smith:
Interleaving two-phased jobs on a single machine. Discret. Optim. 2(4): 348-361 (2005) - [j12]J. Cole Smith, Sheldon H. Jacobson:
An Analysis of the Alias Method for Discrete Random-Variate Generation. INFORMS J. Comput. 17(3): 321-327 (2005) - [j11]Jennifer A. Horne, J. Cole Smith:
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. Networks 46(4): 177-185 (2005) - [j10]Jennifer A. Horne, J. Cole Smith:
A dynamic programming algorithm for the conditional covering problem on tree graphs. Networks 46(4): 186-197 (2005) - 2004
- [j9]J. Cole Smith:
Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. Eur. J. Oper. Res. 154(3): 659-672 (2004) - [j8]J. Cole Smith, Andrew J. Schaefer, Joyce W. Yen:
A stochastic integer programming approach to solving a synchronous optical network ring design problem. Networks 44(1): 12-26 (2004) - [c1]Enock Chisonge Mofya, Jonathan Cole Smith:
The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks. ISI 2004: 239-251 - 2003
- [j7]Kenneth R. Baker, J. Cole Smith:
A Multiple-Criterion Model for Machine Scheduling. J. Sched. 6(1): 7-16 (2003) - 2002
- [j6]Hanif D. Sherali, J. Cole Smith, Antonio A. Trani:
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations. Transp. Sci. 36(4): 378-397 (2002) - 2001
- [b1]J. Cole Smith:
Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems. Virginia Tech, Blacksburg, VA, USA, 2001 - [j5]Hanif D. Sherali, J. Cole Smith, Shokri Z. Selim:
Convex hull representations of models for computing collisions between multiple bodies. Eur. J. Oper. Res. 135(3): 514-526 (2001) - [j4]Hanif D. Sherali, J. Cole Smith:
Improving Discrete Model Representations via Symmetry Considerations. Manag. Sci. 47(10): 1396-1407 (2001) - 2000
- [j3]Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams:
Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discret. Appl. Math. 101(1-3): 247-267 (2000) - [j2]Hanif D. Sherali, J. Cole Smith, Youngho Lee:
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting. INFORMS J. Comput. 12(4): 284-298 (2000) - [j1]Hanif D. Sherali, J. Cole Smith, Antonio A. Trani, Srinivas Sale:
National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm. Transp. Sci. 34(4): 321-336 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 18:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
