The following pages link to J. Cole Smith (Q228527):
Displaying 24 items.
- Securing a border under asymmetric information (Q4632821) (← links)
- A robust sensor covering and communication problem (Q4632910) (← links)
- Exact algorithms and bounds for the dynamic assignment interdiction problem (Q4632979) (← links)
- Dynamic shortest‐path interdiction (Q4642404) (← links)
- On a Random Walk Survivability problem with arc failures and memory (Q4642452) (← links)
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem (Q4642473) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Radar pulse interleaving for multi‐target tracking (Q4651710) (← links)
- Algorithms for solving the conditional covering problem on paths (Q4680424) (← links)
- A stochastic integer programming approach to solving a synchronous optical network ring design problem (Q4812396) (← links)
- Designing fair 8- and 16-team knockout tournaments (Q4925188) (← links)
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
- In Memoriam: Shabbir Ahmed (1969–2019) (Q5139620) (← links)
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network (Q5191132) (← links)
- Shortest path interdiction problem with arc improvement recourse: A multiobjective approach (Q5226166) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- A bracket assignment problem for the National Collegiate Athletic Association Men's Basketball Tournament (Q5449880) (← links)
- Dynamic programming algorithms for the conditional covering problem on path and extended star graphs (Q5717712) (← links)
- A dynamic programming algorithm for the conditional covering problem on tree graphs (Q5717713) (← links)
- A Backward Sampling Framework for Interdiction Problems with Fortification (Q5739135) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)
- A two‐stage network interdiction‐monitoring game (Q6179685) (← links)
- On Aligning Non-Order-Associated Binary Decision Diagrams (Q6200129) (← links)
