J. Cole Smith

Orcid: 0000-0001-5106-6964

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A two-stage network interdiction-monitoring game.
Networks, April, 2023

On Aligning Non-Order-Associated Binary Decision Diagrams.
INFORMS J. Comput., 2023

2022
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems.
Networks, 2022

A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs.
Math. Program., 2022

Network interdiction with asymmetric cost uncertainty.
Eur. J. Oper. Res., 2022

2021
Preface.
Networks, 2021

The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms.
Oper. Res., 2021

2020
On the Consistent Path Problem.
Oper. Res., 2020

A survey of network interdiction models and algorithms.
Eur. J. Oper. Res., 2020

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

2018
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations.
Eur. J. Oper. Res., 2018

Partial objective inequalities for the multi-item capacitated lot-sizing problem.
Comput. Oper. Res., 2018

2017
Solving the traveling salesman problem with interdiction and fortification.
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

A Backward Sampling Framework for Interdiction Problems with Fortification.
INFORMS J. Comput., 2017

2016
Dynamic shortest-path interdiction.
Networks, 2016

A class of algorithms for mixed-integer bilevel min-max optimization.
J. Glob. Optim., 2016

Preface.
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
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems.
J. Sched., 2015

On a Random Walk Survivability problem with arc failures and memory.
Networks, 2015

A branch-and-price-and-cut method for computing an optimal bramble.
Discret. Optim., 2015

2014
Exact algorithms for solving a Euclidean maximum flow network interdiction problem.
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

A cutting-plane algorithm for solving a weighted influence interdiction problem.
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

A decomposition approach for solving a broadcast domination network design problem.
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

A combinatorial optimization algorithm for solving the branchwidth problem.
Comput. Optim. Appl., 2012

Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.
Ann. Oper. Res., 2012

2011
Finite Optimal Stopping Problems: The Seller’s Perspective.
J. Probl. Solving, 2011

2010
Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths.
Manag. Sci., 2010

Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning.
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

Two-stage stochastic hierarchical multiple risk problems: models and algorithms.
Math. Program., 2009

A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures.
INFORMS J. Comput., 2009

Cutting plane algorithms for solving a stochastic edge-partition problem.
Discret. Optim., 2009

2008
Preface.
Networks, 2008

Branch-and-price-and-cut algorithms for solving the reliable <i>h</i> -paths problem.
J. Glob. Optim., 2008

Optimization Support for Senior Design Project Assignments.
Interfaces, 2008

Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations.
INFORMS J. Comput., 2008

2007
On the multi-attribute stopping problem with general value functions.
Oper. Res. Lett., 2007

An improved linearization strategy for zero-one quadratic programming problems.
Optim. Lett., 2007

Survivable network design under optimal and heuristic interdiction scenarios.
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
A polyhedral study of the generalized vertex packing problem.
Math. Program., 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

Sequential Search with Multiattribute Options.
Decis. Anal., 2006

2005
A dynamic programming algorithm for the conditional covering problem on tree graphs.
Networks, 2005

Dynamic programming algorithms for the conditional covering problem on path and extended star graphs.
Networks, 2005

An Analysis of the Alias Method for Discrete Random-Variate Generation.
INFORMS J. Comput., 2005

Interleaving two-phased jobs on a single machine.
Discret. Optim., 2005

A class of web-based facets for the generalized vertex packing problem.
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
A Multiple-Criterion Model for Machine Scheduling.
J. Sched., 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

Improving Discrete Model Representations via Symmetry Considerations.
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


  Loading...