Smith J Cole

J Cole Smith

Information about the author J Cole Smith will soon be added to the site.
Found 13 papers in total
Branch-cut-price algorithms for solving a class of search problems on general graphs
Branch-cut-price algorithms for solving a class of search problems on general graphs
2017
We consider graph search problems involving an intruder and mobile searchers. The...
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
2017
We examine bilevel mixed‐integer programs whose constraints and objective...
A Backward Sampling Framework for Interdiction Problems with Fortification
A Backward Sampling Framework for Interdiction Problems with Fortification
2017
This paper examines a class of three‐stage sequential...
Dynamic shortest-path interdiction
Dynamic shortest-path interdiction
2016
We study a dynamic network game between an attacker and a user. The user wishes to...
A robust sensor covering and communication problem
A robust sensor covering and communication problem
2015
We consider the problem of placing sensors across some area of interest. The sensors...
A branch-and-price-and-cut method for computing an optimal bramble
A branch-and-price-and-cut method for computing an optimal bramble
2015
Given an undirected graph, a bramble is a set of connected subgraphs (called bramble...
On a Random Walk Survivability problem with arc failures and memory
On a Random Walk Survivability problem with arc failures and memory
2015
Consider a directed network in which each arc can fail with some specified...
Exact interdiction models and algorithms for disconnecting networks via node deletions
Exact interdiction models and algorithms for disconnecting networks via node deletions
2012
This paper analyzes the problem of maximizing the disconnectivity of undirected graphs...
Expectation and Chance‐Constrained Models and Algorithms for Insuring Critical Paths
Expectation and Chance‐Constrained Models and Algorithms for Insuring Critical Paths
2010
In this paper, we consider a class of two‐stage stochastic optimization...
An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs
An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs
2010
We study a stochastic scenario‐based facility location problem arising in...
Optimal multileaf collimator leaf sequencing in IMRT treatment planning
Optimal multileaf collimator leaf sequencing in IMRT treatment planning
2010
We consider a problem dealing with the efficient delivery of intensity modulated...
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
2008
Most traditional routing problems assume perfect operability of all arcs and nodes....
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
2008
We examine a routing problem in which network arcs fail according to independent...
Papers per page: