J. Cole Smith
Orcid: 0000-0001-5106-6964Affiliations:
- Syracuse University, NY, USA
- Clemson University, Department of Industrial Engineering, SC, USA (former)
- University of Arizona, Department of Systems and Industrial Engineering, Tucson, AZ, USA (former)
- University of Florida, Department of Industrial and Systems Engineering, Gainesville, FL, USA (former)
- Virginia Tech, Department of Industrial and Systems Engineering, Blacksburg, VA, USA (PhD 2000)
According to our database1,
J. Cole Smith
authored at least 74 papers
between 2000 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on clemson.edu
-
on orcid.org
On csauthors.net:
Bibliography
2023
2022
Networks, 2022
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs.
Math. Program., 2022
2021
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms.
Oper. Res., 2021
2020
2019
2018
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations.
Eur. J. Oper. Res., 2018
Comput. Oper. Res., 2018
2017
Oper. Res. Lett., 2017
Branch-cut-price algorithms for solving a class of search problems on general graphs.
Networks, 2017
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem.
Oper. Res., 2017
INFORMS J. Comput., 2017
2016
J. Glob. Optim., 2016
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem.
Discret. Optim., 2016
A survey of optimization algorithms for wireless sensor network lifetime maximization.
Comput. Ind. Eng., 2016
2015
J. Sched., 2015
Discret. Optim., 2015
2014
Networks, 2014
Convex hull representation of the deterministic bipartite network interdiction problem.
Math. Program., 2014
Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations.
J. Optim. Theory Appl., 2014
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput., 2014
Comput. Optim. Appl., 2014
2013
Distributed Algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink.
IEEE Trans. Mob. Comput., 2013
Integer programming models and algorithms for the graph decontamination problem with mobile agents.
Networks, 2013
Ann. Oper. Res., 2013
2012
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs.
Optim. Lett., 2012
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs.
Networks, 2012
Exact interdiction models and algorithms for disconnecting networks via node deletions.
Discret. Optim., 2012
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks.
Comput. Oper. Res., 2012
Comput. Optim. Appl., 2012
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.
Ann. Oper. Res., 2012
2011
2010
Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths.
Manag. Sci., 2010
Oper. Res., 2010
2009
An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models.
Optim. Methods Softw., 2009
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network.
Networks, 2009
Math. Program., 2009
A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures.
INFORMS J. Comput., 2009
Discret. Optim., 2009
2008
Branch-and-price-and-cut algorithms for solving the reliable <i>h</i> -paths problem.
J. Glob. Optim., 2008
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations.
INFORMS J. Comput., 2008
2007
Oper. Res. Lett., 2007
Optim. Lett., 2007
J. Glob. Optim., 2007
A packet filter placement problem with application to defense against spoofed denial of service attacks.
Eur. J. Oper. Res., 2007
2006
Exact and heuristic algorithms for solving the generalized minimum filter placement problem.
J. Comb. Optim., 2006
A bracket assignment problem for the National Collegiate Athletic Association Men's Basketball Tournament.
Int. Trans. Oper. Res., 2006
2005
Networks, 2005
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs.
Networks, 2005
INFORMS J. Comput., 2005
Discret. Appl. Math., 2005
2004
A stochastic integer programming approach to solving a synchronous optical network ring design problem.
Networks, 2004
Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
Eur. J. Oper. Res., 2004
The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks.
Proceedings of the Intelligence and Security Informatics, 2004
2003
2002
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations.
Transp. Sci., 2002
2001
Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems.
PhD thesis, 2001
Manag. Sci., 2001
Convex hull representations of models for computing collisions between multiple bodies.
Eur. J. Oper. Res., 2001
2000
National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm.
Transp. Sci., 2000
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting.
INFORMS J. Comput., 2000
Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations.
Discret. Appl. Math., 2000