J. Smith

发表

Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning

Z. Caner Taskin, Jonathan Cole Smith, H. Edwin Romeijn, 2010, Oper. Res..

Interleaving two-phased jobs on a single machine

H. Sherali, J. Smith, 2005, Discret. Optim..

A class of algorithms for mixed-integer bilevel min–max optimization

Jonathan Cole Smith, Jean-Philippe P. Richard, Yen Tang, 2015, Journal of Global Optimization.

Cutting plane algorithms for solving a stochastic edge-partition problem

Z. Caner Taskin, Jonathan Cole Smith, Andrew J. Schaefer, 2009, Discret. Optim..

Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems

Jonathan Cole Smith, J. Smith, 2000 .

Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations

J. C. Smith, Tim Holzmann, J. Smith, 2018, Eur. J. Oper. Res..

Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths

Jonathan Cole Smith, Shabbir Ahmed, Siqian Shen, 2010, Manag. Sci..

A Multiple-Criterion Model for Machine Scheduling

Jonathan Cole Smith, Kenneth R. Baker, K. R. Baker, 2003, J. Sched..

A mixed-integer bilevel programming approach for a competitive prioritized set covering problem

Jonathan Cole Smith, Mehdi Hemmati, J. Smith, 2016, Discret. Optim..

Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks

Jonathan Cole Smith, Ye Xia, Behnam Behdani, 2012, Comput. Oper. Res..

Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations

Jonathan Cole Smith, April K. Andreas, J. Smith, 2008, INFORMS J. Comput..

A Backward Sampling Framework for Interdiction Problems with Fortification

J. Cole Smith, Leonardo Lozano, J. Smith, 2017, INFORMS J. Comput..

A survey of optimization algorithms for wireless sensor network lifetime maximization

Jonathan Cole Smith, Robert M. Curry, J. Smith, 2016, Comput. Ind. Eng..

A polyhedral study of the generalized vertex packing problem

Hanif D. Sherali, J. Cole Smith, H. Sherali, 2006, Math. Program..

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs

H. Sherali, J. Smith, 2012, Optim. Lett..

An improved linearization strategy for zero-one quadratic programming problems

Hanif D. Sherali, Jonathan Cole Smith, H. Sherali, 2006, Optim. Lett..

On the multi-attribute stopping problem with general value functions

Jonathan Cole Smith, Churlzu Lim, J. Neil Bearden, 2007, Oper. Res. Lett..

Sequential Search with Multiattribute Options

Jonathan Cole Smith, Churlzu Lim, J. Neil Bearden, 2006, Decis. Anal..

Partial objective inequalities for the multi-item capacitated lot-sizing problem

Jonathan Cole Smith, Joseph C. Hartman, I. Esra Büyüktahtakin, 2018, Comput. Oper. Res..

Improving Discrete Model Representations via Symmetry Considerations

Hanif D. Sherali, Jonathan Cole Smith, H. Sherali, 2001, Manag. Sci..

An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem

Jonathan Cole Smith, Behnam Behdani, J. Smith, 2014, INFORMS J. Comput..

Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs

Jonathan Cole Smith, Siqian Shen, J. Smith, 2012, Networks.

A survey of network interdiction models and algorithms

J. Cole Smith, Yongjia Song, J. Smith, 2020, Eur. J. Oper. Res..

The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms

Tim Holzmann, Jonathan Cole Smith, J. Smith, 2021, Oper. Res..

Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations

Jonathan Cole Smith, Bita Tadayon, J. Smith, 2014, J. Optim. Theory Appl..

A two‐stage network interdiction‐monitoring game

J. C. Smith, J. Smith, Yongjia Song, 2022, Networks.

Network interdiction with asymmetric cost uncertainty

Di H. Nguyen, J. Cole Smith, J. Smith, 2021, Eur. J. Oper. Res..

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

Jonathan Cole Smith, Enock Chisonge Mofya, J. Smith, 2005, J. Comb. Optim..

Exact interdiction models and algorithms for disconnecting networks via node deletions

Jonathan Cole Smith, Siqian Shen, Roshan Goli, 2012, Discret. Optim..

A packet filter placement problem with application to defense against spoofed denial of service attacks

Jonathan Cole Smith, Kihong Park, Benjamin Armbruster, 2007, Eur. J. Oper. Res..

A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs

Leonardo Lozano, J. Cole Smith, J. Smith, 2018, Math. Program..

On a Random Walk Survivability problem with arc failures and memory

Jonathan Cole Smith, Burak Büke, Sadie Thomas, 2015, Networks.

A branch-and-price-and-cut method for computing an optimal bramble

Jonathan Cole Smith, Illya V. Hicks, Sibel B. Sonuc, 2015, Discret. Optim..

A combinatorial optimization algorithm for solving the branchwidth problem

Jonathan Cole Smith, Illya V. Hicks, Elif Ulusal, 2012, Comput. Optim. Appl..

National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm

Antonio A Trani, Hanif D Sherali, J Cole Smith, 2000, Transp. Sci..

Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems

Jonathan Cole Smith, Bita Tadayon, J. Smith, 2015, J. Sched..

Exact algorithms for solving a Euclidean maximum flow network interdiction problem

Jonathan Cole Smith, Kelly M. Sullivan, J. Smith, 2014, Networks.

Convex hull representation of the deterministic bipartite network interdiction problem

Jonathan Cole Smith, Kelly M. Sullivan, David P. Morton, 2014, Math. Program..

Survivable network design under optimal and heuristic interdiction scenarios

Jonathan Cole Smith, Churlzu Lim, Fransisca Sudargho, 2007, J. Glob. Optim..

A stochastic integer programming approach to solving a synchronous optical network ring design problem

Jonathan Cole Smith, Andrew J. Schaefer, Joyce W. Yen, 2004, Networks.

An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems

Robert M. Curry, J. Smith, 2021, Networks.

Two-stage stochastic hierarchical multiple risk problems: models and algorithms

Hanif D. Sherali, Jonathan Cole Smith, H. Sherali, 2009, Math. Program..

Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting

Hanif D. Sherali, Jonathan Cole Smith, Youngho Lee, 2000, INFORMS J. Comput..

A class of web-based facets for the generalized vertex packing problem

Hanif D. Sherali, Jonathan Cole Smith, H. Sherali, 2005, Discret. Appl. Math..

A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

Jonathan Cole Smith, Leonardo Lozano, J. Smith, 2017, Oper. Res..