REFEREED JOURNAL PUBLICATIONS (Updated 8/11/09)

 

 

2000

 

[1]     Sherali, H.D., Smith, J.C., and Adams, W.P., “Reduced First-Level Representations Via the Reformulation-Linearization Technique:  Results, Counter-Examples, and Computations,” Discrete Applied Mathematics, 101 (1), 247-267, 2000.

[2]     Sherali, H.D., Smith, J.C., and Lee, Y., “Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting,” INFORMS Journal on Computing, 12 (4), 284-298, 2000.

[3]     Sherali, H.D., Smith, J.C., Trani, A.A., and Sale, S., “National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios Under the Free-Flight Paradigm,” Transportation Science, 34, 321-336, 2000.

 

2001

 

[4]     Sherali, H.D., Smith, J.C., and Selim, S.Z., “Convex Hull Representations of Models for Computing Collisions Between Multiple Bodies,” European Journal of Operational Research, 135 (3), 514-526, 2001.

[5]     Sherali, H.D. and Smith, J.C., “Improving Zero-One Model Representations Via Symmetry Considerations,” Management Science, 47 (10), 1396-1407, 2001.

 

2002

 

[6]     Sherali, H.D., Smith, J.C., and Trani, A.A., “An Airspace Planning Model for Selecting Flight-Plans Under Workload, Safety, and Equity Considerations,” Transportation Science, 36 (4), 378-397, 2002.

 

2003

 

[7]     Smith, J.C., “A Genetic Algorithm Approach to Solving a Multiple Inventory Loading Problem,” International Journal of Industrial Engineering, 10 (1), 7-16, 2003.

[8]     Baker, K. and Smith, J.C., “A Multiple-Criterion Model for Machine Scheduling,” Journal of Scheduling, 6, 7-16, 2003.

 

2004

 

[9]     Smith, J.C., “Algorithms for Distributing Telecommunication Traffic on a Multiple-Ring SONET-Based Network,” European Journal of Operational Research, 154 (3), 659-672, 2004.

[10]   Elshafei, M., Sherali, H.D., and Smith, J.C., “Radar Pulse Interleaving for Multi-Target Tracking,” Naval Research Logistics, 51 (1), 72-94, 2004.

[11]   Smith, J.C., Schaefer, A., and Yen, J., “A Stochastic Integer Programming Approach to Solving a Synchronous Optical Network Ring Design Problem,” Networks, 44 (1), 12-26, 2004.

[12]   Mofya, E.C. and Smith, J.C., “The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks,” Lecture Notes on Computer Science, (3073), 239-251, 2004. 

 

2005

 

[13]   Smith, J.C. and Jacobson, S.H., “An Analysis of the Alias Method for Discrete Random-Variate Generation,” INFORMS Journal on Computing, 17 (3), 321-327, 2005.

[14]   Lunday, B.J., Smith, J.C., and Goldberg, J.B., “Algorithms for Solving the Conditional Covering Problem on Paths,” Naval Research Logistics, 52 (4), 293-301, 2005.

[15]   Sherali, H.D. and Smith, J.C., “A Class of Web-Based Facets for the Generalized Vertex Packing Problem,” Discrete Applied Mathematics, 146 (3), 273-286, 2005.

[16]   Horne, J.A. and Smith, J.C., “A Dynamic Programming Algorithm for the Conditional Covering Problem on Tree Graphs,” Networks, 46 (4), 186-197, 2005.

[17]   Horne, J.A. and Smith, J.C., “Dynamic Programming Algorithms for the Conditional Covering Problem on Path and Extended Star Graphs,” Networks, 46 (4), 177-185, 2005.

[18]   Sherali, H.D. and Smith, J.C., “Interleaving Two-Phased Jobs on a Single Machine with Application to Radar Pulse Interleaving,” Discrete Optimization, 2 (4), 348-361, 2005.

 

2006

 

[19]   Lim, C., Bearden, J.N., and Smith, J.C., “Sequential Search with Multi-Attribute Options,” Decision Analysis, 3 (1), 3-15, 2006.

[20]   Sherali, H.D. and Smith, J.C., “A Polyhedral Study of the Generalized Vertex Packing Problem,” Mathematical Programming, Series A, 107 (3), 367-390, 2006.

[21]   Smith, J.C., Fraticelli, B.M.P, and Rainwater, C., “A Bracket Assignment Problem for the NCAA Men’s Basketball Tournament,” International Transactions in Operational Research, 13 (3), 253-271, 2006.

[22]   Mofya, E.C. and Smith, J.C., “Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem,” Journal of Combinatorial Optimization, 12 (3), 231-256, 2006.

 

2007

 

[23]   Armbruster, B., Smith, J.C., and Park, K., “The Optimization of Packet Filter Placements to Combat Distributed Denial of Service Attacks,” European Journal of Operational Research, 176(2), 1283-1292, 2007.

[24]   Lim, C. and Smith, J.C., “Algorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems,” IIE Transactions, 39(1), 15-26, 2007.

[25]   Sherali, H.D. and Smith, J.C., “An Improved Linearization Strategy for Zero-One Quadratic Programming Problems,” Optimization Letters, 1(1), 33-47, 2007.

[26]   Smith, J.C., Lim, C., and Bearden, J.N., “On the Optimality of a Threshold Policy for a Multi-attribute Stopping Problem with General Value Functions,”  Operations Research Letters, 35(3), 324-330, 2007.

[27]   Smith, J.C., Lim, C., and Sudargho, F., “Survivable Network Design Under Optimal and Heuristic Interdiction Scenarios,” Journal of Global Optimization, 38(2), 181-199, 2007.

[28]   Smith, C.M., Smith, J.C., Williams, S.K., Rodriguez, J.J., and Hoying, J.B. “Accurate Volumetric Measurements of Vasculature Using Confocal Microscopy and Image Processing,” Journal of Microscopy, 225(3), 244-257, 2007.

[29]   Ragle, M.A., Smith, J.C., and Pardalos, P.M., “An Optimal Cutting-Plane Algorithm for Solving the Non-Unique Probe Selection Problem,” Annals of Biomedical Engineering, 35(11), 2023-2030, 2007.

 

2008 –

 

[30]   Garg, M. and Smith, J.C., “Models and Algorithms for the Design of Survivable Networks with General Failure Scenarios,” Omega, 36(6), 1057-1071, 2008.

[31]   Andreas, A.K., Smith, J.C., and Kόηόkyavuz, S., “A Branch-and-Price-and-Cut Algorithm for Solving the Reliable h-paths Problem,” Journal of Global Optimization, 42(4), 443-466, 2008.

[32]   Andreas, A.K. and Smith, J.C., “Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Constraints,” INFORMS Journal on Computing, 20(4), 553-564, 2008.

[33]   Lopes, L., Aronson, M., Carstensen, G., and Smith, J.C., “Optimization Support for Senior Design Project Assignments,” Interfaces, 38(6), 448-464, 2008.

 

2009 –

 

[34]   Andreas, A.K. and Smith, J.C., “Decomposition Algorithms for the Design of a Non-simultaneous Capacitated Evacuation Tree Network,” Networks, 53(2), 91-103, 2009.

[35]   Smith, J.C., Henderson, D., Ortega, A., and DeVoe, J., “A Parameter Optimization Heuristic for a Temperature Estimation Model,” Optimization and Engineering, 10(1), 19-42, 2009.

[36]   Sherali, H.D. and Smith, J.C., “Two-Stage Stochastic Risk Threshold and Hierarchical Multiple Risk Problems:  Models and Algorithms,” Mathematical Programming, Series A, 120(2), 403-427, 2009.

[37]   Smith, J.C., “Organization of the NCAA Baseball Tournament,” IMA Journal of Management Mathematics, 20(2), 213-232, 2009.

[38]   Mofya, E.C. and Smith, J.C., “A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures,” INFORMS Journal on Computing, 21(2), 322-332, 2009.

[39]   Henderson, D. and Smith, J.C., “An Exact Reformulation-Linearization Technique Algorithm for Solving a Parameter Extraction Problem Arising in Compact Thermal Models,” Optimization Methods and Software, 24(4-5), 857-870, 2009.

[40]   Taskın, Z.C., Smith, J.C., Romeijn, H.E., and Dempsey, J.F., “Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning,” to appear in Operations Research.

[41]   Taskın, Z.C., Smith, J.C., Ahmed, S., and Schaefer, A.J., “Cutting Plane Algorithms for Solving a Robust Edge-Partition Problem,” to appear in Discrete Optimization.

[42]   Smith, J.C., Lim, C., and Alptekinoglu, A., “Optimal Mixed-Integer Programming and Heuristic Methods for a Bilevel Stackelberg Product Introduction Game,” to appear in Naval Research Logistics.

 

      Papers Under Review

 

[43]   Taskın, Z.C., Smith, J.C., and Romeijn, H.E. “Mixed-Integer Programming Techniques for Decomposing IMRT Fluence Maps Using Rectangular Apertures,” revision submitted to Annals of Operations Research.

[44]   Hartman, J.C., Bόyόktahtakın, İ.E., and Smith, J.C., “Dynamic Programming Based Inequalities for the Capacitated Lot-Sizing Problem,” revision submitted to IIE Transactions.

[45]   Penuel, J. and Smith, J.C., “An Integer Decomposition Algorithm for Solving a Two-Stage Facility Location Problem with Second-Stage Activation Costs,” under second revision for Naval Research Logistics.

[46]   Shen, S., Smith, J.C., and Ahmed, S., “Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths,” submitted to Management Science.

[47]   Penuel, J. and Smith, J.C., “Models and Complexity Analysis for the Graph Decontamination Problem with Mobile Agents,” submitted to Networks.   

[48]  Smith, J.C., Ulusal, E., and Hicks, I.V., “A Combinatorial Optimization Algorithm for Solving the Branchwidth Problem,” submitted to Journal of Combinatorial Optimization.